%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP113-1 : TPTP v8.1.0. Released v1.1.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 : n020.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:04:28 EDT 2022 % Result : Unsatisfiable 33.10s 4.52s % Output : CNFRefutation 33.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP113-1 : TPTP v8.1.0. Released v1.1.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.14/0.34 % Computer : n020.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 13 04:56:35 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 16 Number of unprocessed: 16 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 16 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 4 conjectures. % 0.14/0.37 # There are 4 start rule candidates: % 0.14/0.37 # Found 11 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 4 start rule tableaux created. % 0.14/0.37 # 5 extension rule candidate clauses % 0.14/0.37 # 11 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.14/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.14/0.37 # We now have 9 tableaux to operate on % 30.07/4.13 # Creating equality axioms % 30.07/4.13 # Ran out of tableaux, making start rules for all clauses % 30.14/4.14 # Creating equality axioms % 30.14/4.14 # Ran out of tableaux, making start rules for all clauses % 30.14/4.14 # Creating equality axioms % 30.14/4.14 # Ran out of tableaux, making start rules for all clauses % 30.14/4.14 # Creating equality axioms % 30.14/4.14 # Ran out of tableaux, making start rules for all clauses % 30.14/4.14 # Creating equality axioms % 30.14/4.14 # Ran out of tableaux, making start rules for all clauses % 30.14/4.17 # Creating equality axioms % 30.14/4.17 # Ran out of tableaux, making start rules for all clauses % 30.14/4.19 # Creating equality axioms % 30.14/4.19 # Ran out of tableaux, making start rules for all clauses % 33.10/4.52 # There were 1 total branch saturation attempts. % 33.10/4.52 # There were 0 of these attempts blocked. % 33.10/4.52 # There were 0 deferred branch saturation attempts. % 33.10/4.52 # There were 0 free duplicated saturations. % 33.10/4.52 # There were 1 total successful branch saturations. % 33.10/4.52 # There were 0 successful branch saturations in interreduction. % 33.10/4.52 # There were 0 successful branch saturations on the branch. % 33.10/4.52 # There were 1 successful branch saturations after the branch. % 33.10/4.52 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 33.10/4.52 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 33.10/4.52 # Begin clausification derivation % 33.10/4.52 % 33.10/4.52 # End clausification derivation % 33.10/4.52 # Begin listing active clauses obtained from FOF to CNF conversion % 33.10/4.52 cnf(i_0_20, plain, (multiply(X1,identity)=X1)). % 33.10/4.52 cnf(i_0_17, plain, (multiply(identity,X1)=X1)). % 33.10/4.52 cnf(i_0_21, plain, (multiply(X1,inverse(X1))=identity)). % 33.10/4.52 cnf(i_0_18, plain, (multiply(inverse(X1),X1)=identity)). % 33.10/4.52 cnf(i_0_19, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 33.10/4.52 cnf(i_0_25, hypothesis, (identity!=a)). % 33.10/4.52 cnf(i_0_27, hypothesis, (identity!=b)). % 33.10/4.52 cnf(i_0_23, hypothesis, (b!=a)). % 33.10/4.52 cnf(i_0_28, hypothesis, (identity!=c)). % 33.10/4.52 cnf(i_0_24, hypothesis, (c!=a)). % 33.10/4.52 cnf(i_0_26, hypothesis, (c!=b)). % 33.10/4.52 cnf(i_0_29, negated_conjecture, (multiply(a,a)!=identity|multiply(b,b)!=identity|multiply(c,c)!=identity)). % 33.10/4.52 cnf(i_0_22, hypothesis, (X1=c|X1=b|X1=a|X1=identity)). % 33.10/4.52 cnf(i_0_30, negated_conjecture, (multiply(a,multiply(a,multiply(a,a)))!=identity|multiply(a,multiply(a,a))!=c|multiply(a,a)!=b)). % 33.10/4.52 cnf(i_0_31, negated_conjecture, (multiply(b,multiply(b,multiply(b,b)))!=identity|multiply(b,multiply(b,b))!=a|multiply(b,b)!=c)). % 33.10/4.52 cnf(i_0_32, negated_conjecture, (multiply(c,multiply(c,multiply(c,c)))!=identity|multiply(c,multiply(c,c))!=b|multiply(c,c)!=a)). % 33.10/4.52 cnf(i_0_189, plain, (X4=X4)). % 33.10/4.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 33.10/4.52 # Begin printing tableau % 33.10/4.52 # Found 6 steps % 33.10/4.52 cnf(i_0_189, plain, (X7=X7), inference(start_rule)). % 33.10/4.52 cnf(i_0_222, plain, (X7=X7), inference(extension_rule, [i_0_193])). % 33.10/4.52 cnf(i_0_248, plain, (multiply(identity,identity)!=identity), inference(closure_rule, [i_0_20])). % 33.10/4.52 cnf(i_0_246, plain, (multiply(X7,multiply(identity,identity))=multiply(X7,identity)), inference(extension_rule, [i_0_192])). % 33.10/4.52 cnf(i_0_271, plain, (multiply(X7,identity)!=X7), inference(closure_rule, [i_0_20])). % 33.10/4.52 cnf(i_0_269, plain, (multiply(X7,multiply(identity,identity))=X7), inference(etableau_closure_rule, [i_0_269, ...])). % 33.10/4.52 # End printing tableau % 33.10/4.52 # SZS output end % 33.10/4.52 # Branches closed with saturation will be marked with an "s" % 33.10/4.54 # Child (25410) has found a proof. % 33.10/4.54 % 33.10/4.54 # Proof search is over... % 33.10/4.54 # Freeing feature tree %------------------------------------------------------------------------------