TSTP Solution File: GRP748-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP748-2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 09:08:18 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP748-2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 12:58:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 12 Number of unprocessed: 12
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 12 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 11 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 1 extension rule candidate clauses
% 0.13/0.37 # 11 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 19 tableaux to operate on
% 0.20/0.52 # There were 1 total branch saturation attempts.
% 0.20/0.52 # There were 0 of these attempts blocked.
% 0.20/0.52 # There were 0 deferred branch saturation attempts.
% 0.20/0.52 # There were 0 free duplicated saturations.
% 0.20/0.52 # There were 1 total successful branch saturations.
% 0.20/0.52 # There were 0 successful branch saturations in interreduction.
% 0.20/0.52 # There were 0 successful branch saturations on the branch.
% 0.20/0.52 # There were 1 successful branch saturations after the branch.
% 0.20/0.52 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 # Begin clausification derivation
% 0.20/0.52
% 0.20/0.52 # End clausification derivation
% 0.20/0.52 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.52 cnf(i_0_17, plain, (mult(X1,unit)=X1)).
% 0.20/0.52 cnf(i_0_18, plain, (mult(unit,X1)=X1)).
% 0.20/0.52 cnf(i_0_21, plain, (mult(X1,i(X1))=unit)).
% 0.20/0.52 cnf(i_0_22, plain, (mult(i(X1),X1)=unit)).
% 0.20/0.52 cnf(i_0_14, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.20/0.52 cnf(i_0_13, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.20/0.52 cnf(i_0_15, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.20/0.52 cnf(i_0_16, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.20/0.52 cnf(i_0_20, plain, (mult(mult(X1,X2),i(X2))=X1)).
% 0.20/0.52 cnf(i_0_19, plain, (mult(mult(mult(X1,X2),X3),X2)=mult(X1,mult(mult(X2,X3),X2)))).
% 0.20/0.52 cnf(i_0_24, negated_conjecture, (mult(mult(mult(a,b),a),c)!=mult(a,mult(b,mult(a,c))))).
% 0.20/0.52 cnf(i_0_23, plain, (mult(i(X1),mult(X1,X2))=X2|mult(X1,X2)=mult(X2,X1))).
% 0.20/0.52 cnf(i_0_28, plain, (X4=X4)).
% 0.20/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.52 # Begin printing tableau
% 0.20/0.52 # Found 6 steps
% 0.20/0.52 cnf(i_0_18, plain, (mult(unit,X3)=X3), inference(start_rule)).
% 0.20/0.52 cnf(i_0_37, plain, (mult(unit,X3)=X3), inference(extension_rule, [i_0_32])).
% 0.20/0.52 cnf(i_0_81, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_17])).
% 0.20/0.52 cnf(i_0_79, plain, (ld(mult(unit,X3),mult(X5,unit))=ld(X3,X5)), inference(extension_rule, [i_0_33])).
% 0.20/0.52 cnf(i_0_93, plain, (mult(X6,unit)!=X6), inference(closure_rule, [i_0_17])).
% 0.20/0.52 cnf(i_0_91, plain, (mult(ld(mult(unit,X3),mult(X5,unit)),mult(X6,unit))=mult(ld(X3,X5),X6)), inference(etableau_closure_rule, [i_0_91, ...])).
% 0.20/0.52 # End printing tableau
% 0.20/0.52 # SZS output end
% 0.20/0.52 # Branches closed with saturation will be marked with an "s"
% 0.20/0.52 # Child (20649) has found a proof.
% 0.20/0.52
% 0.20/0.52 # Proof search is over...
% 0.20/0.52 # Freeing feature tree
%------------------------------------------------------------------------------