%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE128+1 : 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 : n027.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 : Sun Jul 17 01:57:11 EDT 2022 % Result : Theorem 6.54s 1.20s % Output : CNFRefutation 6.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : KLE128+1 : TPTP v8.1.0. Released v4.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n027.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Thu Jun 16 13:22:05 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 24 Number of unprocessed: 24 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 24 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 21 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 3 extension rule candidate clauses % 0.12/0.37 # 21 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 36 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 36 tableaux to operate on % 6.54/1.20 # There were 1 total branch saturation attempts. % 6.54/1.20 # There were 0 of these attempts blocked. % 6.54/1.20 # There were 0 deferred branch saturation attempts. % 6.54/1.20 # There were 0 free duplicated saturations. % 6.54/1.20 # There were 1 total successful branch saturations. % 6.54/1.20 # There were 0 successful branch saturations in interreduction. % 6.54/1.20 # There were 0 successful branch saturations on the branch. % 6.54/1.20 # There were 1 successful branch saturations after the branch. % 6.54/1.20 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.54/1.20 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.54/1.20 # Begin clausification derivation % 6.54/1.20 % 6.54/1.20 # End clausification derivation % 6.54/1.20 # Begin listing active clauses obtained from FOF to CNF conversion % 6.54/1.20 cnf(i_0_32, negated_conjecture, (divergence(esk1_0)=zero)). % 6.54/1.20 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 6.54/1.20 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 6.54/1.20 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 6.54/1.20 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 6.54/1.20 cnf(i_0_14, plain, (multiplication(antidomain(X1),X1)=zero)). % 6.54/1.20 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 6.54/1.20 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 6.54/1.20 cnf(i_0_18, plain, (multiplication(X1,coantidomain(X1))=zero)). % 6.54/1.20 cnf(i_0_28, plain, (antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1))))))=divergence(X1))). % 6.54/1.20 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 6.54/1.20 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 6.54/1.20 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 6.54/1.20 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 6.54/1.20 cnf(i_0_20, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)). % 6.54/1.20 cnf(i_0_15, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))). % 6.54/1.20 cnf(i_0_31, negated_conjecture, (addition(antidomain(antidomain(esk2_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))))=antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))))). % 6.54/1.20 cnf(i_0_19, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))). % 6.54/1.20 cnf(i_0_16, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)). % 6.54/1.20 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 6.54/1.20 cnf(i_0_30, negated_conjecture, (antidomain(antidomain(esk2_0))!=zero)). % 6.54/1.20 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 6.54/1.20 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 6.54/1.20 cnf(i_0_29, plain, (addition(antidomain(antidomain(X1)),addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3)))))))))=addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3))))))))|addition(antidomain(antidomain(X1)),addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3))))!=addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3))))). % 6.54/1.20 cnf(i_0_60, plain, (X56=X56)). % 6.54/1.20 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 6.54/1.20 # Begin printing tableau % 6.54/1.20 # Found 6 steps % 6.54/1.20 cnf(i_0_32, negated_conjecture, (divergence(esk1_0)=zero), inference(start_rule)). % 6.54/1.20 cnf(i_0_71, plain, (divergence(esk1_0)=zero), inference(extension_rule, [i_0_65])). % 6.54/1.20 cnf(i_0_117, plain, (divergence(esk1_0)!=zero), inference(closure_rule, [i_0_32])). % 6.54/1.20 cnf(i_0_115, plain, (multiplication(divergence(esk1_0),divergence(esk1_0))=multiplication(zero,zero)), inference(extension_rule, [i_0_63])). % 6.54/1.20 cnf(i_0_142, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_10])). % 6.54/1.20 cnf(i_0_140, plain, (multiplication(divergence(esk1_0),divergence(esk1_0))=zero), inference(etableau_closure_rule, [i_0_140, ...])). % 6.54/1.20 # End printing tableau % 6.54/1.20 # SZS output end % 6.54/1.20 # Branches closed with saturation will be marked with an "s" % 6.54/1.20 # Child (23253) has found a proof. % 6.54/1.20 % 6.54/1.20 # Proof search is over... % 6.54/1.20 # Freeing feature tree %------------------------------------------------------------------------------