%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KLE129+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 : 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 : Sun Jul 17 01:57:12 EDT 2022 % Result : Theorem 7.65s 1.36s % Output : CNFRefutation 7.65s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : KLE129+1 : 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 : n020.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 : Thu Jun 16 09:43:04 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___100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 23 Number of unprocessed: 23 % 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 # 23 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 2 conjectures. % 0.13/0.37 # There are 2 start rule candidates: % 0.13/0.37 # Found 19 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 2 start rule tableaux created. % 0.13/0.37 # 4 extension rule candidate clauses % 0.13/0.37 # 19 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 2 % 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 35 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 35 tableaux to operate on % 7.65/1.36 # There were 1 total branch saturation attempts. % 7.65/1.36 # There were 0 of these attempts blocked. % 7.65/1.36 # There were 0 deferred branch saturation attempts. % 7.65/1.36 # There were 0 free duplicated saturations. % 7.65/1.36 # There were 1 total successful branch saturations. % 7.65/1.36 # There were 0 successful branch saturations in interreduction. % 7.65/1.36 # There were 0 successful branch saturations on the branch. % 7.65/1.36 # There were 1 successful branch saturations after the branch. % 7.65/1.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.65/1.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.65/1.36 # Begin clausification derivation % 7.65/1.36 % 7.65/1.36 # End clausification derivation % 7.65/1.36 # Begin listing active clauses obtained from FOF to CNF conversion % 7.65/1.36 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)). % 7.65/1.36 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)). % 7.65/1.36 cnf(i_0_3, plain, (addition(X1,zero)=X1)). % 7.65/1.36 cnf(i_0_4, plain, (addition(X1,X1)=X1)). % 7.65/1.36 cnf(i_0_14, plain, (multiplication(antidomain(X1),X1)=zero)). % 7.65/1.36 cnf(i_0_6, plain, (multiplication(X1,one)=X1)). % 7.65/1.36 cnf(i_0_7, plain, (multiplication(one,X1)=X1)). % 7.65/1.36 cnf(i_0_18, plain, (multiplication(X1,coantidomain(X1))=zero)). % 7.65/1.36 cnf(i_0_16, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)). % 7.65/1.36 cnf(i_0_28, plain, (antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1))))))=divergence(X1))). % 7.65/1.36 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))). % 7.65/1.36 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))). % 7.65/1.36 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))). % 7.65/1.36 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))). % 7.65/1.36 cnf(i_0_20, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)). % 7.65/1.36 cnf(i_0_15, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))). % 7.65/1.36 cnf(i_0_19, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))). % 7.65/1.36 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))). % 7.65/1.36 cnf(i_0_30, negated_conjecture, (divergence(esk1_0)!=zero)). % 7.65/1.36 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))). % 7.65/1.36 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)). % 7.65/1.36 cnf(i_0_31, negated_conjecture, (antidomain(antidomain(X1))=zero|addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))))!=antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))))). % 7.65/1.36 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))))). % 7.65/1.36 cnf(i_0_67, plain, (X56=X56)). % 7.65/1.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.65/1.36 # Begin printing tableau % 7.65/1.36 # Found 12 steps % 7.65/1.36 cnf(i_0_10, plain, (multiplication(X6,zero)=zero), inference(start_rule)). % 7.65/1.36 cnf(i_0_78, plain, (multiplication(X6,zero)=zero), inference(extension_rule, [i_0_73])). % 7.65/1.36 cnf(i_0_129, plain, (multiplication(X6,zero)!=zero), inference(closure_rule, [i_0_10])). % 7.65/1.36 cnf(i_0_127, plain, (leq(zero,zero)), inference(extension_rule, [i_0_13])). % 7.65/1.36 cnf(i_0_139, plain, (addition(zero,zero)=zero), inference(extension_rule, [i_0_70])). % 7.65/1.36 cnf(i_0_153, plain, (zero!=multiplication(X6,zero)), inference(closure_rule, [i_0_10])). % 7.65/1.36 cnf(i_0_130, plain, (~leq(multiplication(X6,zero),multiplication(X6,zero))), inference(extension_rule, [i_0_73])). % 7.65/1.36 cnf(i_0_235, plain, (multiplication(X6,zero)!=zero), inference(closure_rule, [i_0_10])). % 7.65/1.36 cnf(i_0_236, plain, (multiplication(X6,zero)!=zero), inference(closure_rule, [i_0_10])). % 7.65/1.36 cnf(i_0_237, plain, (~leq(zero,zero)), inference(extension_rule, [i_0_12])). % 7.65/1.36 cnf(i_0_263, plain, (addition(zero,zero)!=zero), inference(closure_rule, [i_0_3])). % 7.65/1.36 cnf(i_0_151, plain, (addition(zero,zero)=multiplication(X6,zero)), inference(etableau_closure_rule, [i_0_151, ...])). % 7.65/1.36 # End printing tableau % 7.65/1.36 # SZS output end % 7.65/1.36 # Branches closed with saturation will be marked with an "s" % 7.65/1.37 # Child (26089) has found a proof. % 7.65/1.37 % 7.65/1.37 # Proof search is over... % 7.65/1.37 # Freeing feature tree %------------------------------------------------------------------------------