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