%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL002-2 : TPTP v8.1.0. Released v1.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 : n024.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 : Fri Jul 15 00:24:31 EDT 2022 % Result : Unsatisfiable 1.94s 0.63s % Output : CNFRefutation 1.94s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : COL002-2 : TPTP v8.1.0. Released v1.0.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n024.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue May 31 06:16:51 EDT 2022 % 0.13/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S % 0.18/0.36 # and selection function SelectNewComplexAHP. % 0.18/0.36 # % 0.18/0.36 # Number of axioms: 6 Number of unprocessed: 6 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 6 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 5 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 1 extension rule candidate clauses % 0.18/0.36 # 5 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 10 tableaux to operate on % 1.94/0.63 # There were 1 total branch saturation attempts. % 1.94/0.63 # There were 0 of these attempts blocked. % 1.94/0.63 # There were 0 deferred branch saturation attempts. % 1.94/0.63 # There were 0 free duplicated saturations. % 1.94/0.63 # There were 1 total successful branch saturations. % 1.94/0.63 # There were 0 successful branch saturations in interreduction. % 1.94/0.63 # There were 0 successful branch saturations on the branch. % 1.94/0.63 # There were 1 successful branch saturations after the branch. % 1.94/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.94/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.94/0.63 # Begin clausification derivation % 1.94/0.63 % 1.94/0.63 # End clausification derivation % 1.94/0.63 # Begin listing active clauses obtained from FOF to CNF conversion % 1.94/0.63 cnf(i_0_10, plain, (apply(i,X1)=X1)). % 1.94/0.63 cnf(i_0_11, plain, (fixed_point(X1)|apply(fixed_pt,X1)!=X1)). % 1.94/0.63 cnf(i_0_8, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 1.94/0.63 cnf(i_0_9, plain, (apply(apply(apply(c,X1),X2),X3)=apply(apply(X1,X3),X2))). % 1.94/0.63 cnf(i_0_7, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 1.94/0.63 cnf(i_0_12, negated_conjecture, (~fixed_point(apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))))). % 1.94/0.63 cnf(i_0_18, plain, (X4=X4)). % 1.94/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.94/0.63 # Begin printing tableau % 1.94/0.63 # Found 7 steps % 1.94/0.63 cnf(i_0_10, plain, (apply(i,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i)))=apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))), inference(start_rule)). % 1.94/0.63 cnf(i_0_24, plain, (apply(i,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i)))=apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))), inference(extension_rule, [i_0_21])). % 1.94/0.63 cnf(i_0_39, plain, (apply(i,apply(i,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))))!=apply(i,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i)))), inference(closure_rule, [i_0_10])). % 1.94/0.63 cnf(i_0_38, plain, (apply(i,apply(i,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))))=apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))), inference(extension_rule, [i_0_21])). % 1.94/0.63 cnf(i_0_53, plain, (apply(fixed_pt,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i)))=apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))), inference(extension_rule, [i_0_11])). % 1.94/0.63 cnf(i_0_56, plain, (fixed_point(apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i)))), inference(closure_rule, [i_0_12])). % 1.94/0.63 cnf(i_0_54, plain, (apply(i,apply(i,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))))!=apply(fixed_pt,apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i)))), inference(etableau_closure_rule, [i_0_54, ...])). % 1.94/0.63 # End printing tableau % 1.94/0.63 # SZS output end % 1.94/0.63 # Branches closed with saturation will be marked with an "s" % 1.94/0.63 # There were 1 total branch saturation attempts. % 1.94/0.63 # There were 0 of these attempts blocked. % 1.94/0.63 # There were 0 deferred branch saturation attempts. % 1.94/0.63 # There were 0 free duplicated saturations. % 1.94/0.63 # There were 1 total successful branch saturations. % 1.94/0.63 # There were 0 successful branch saturations in interreduction. % 1.94/0.63 # There were 0 successful branch saturations on the branch. % 1.94/0.63 # There were 1 successful branch saturations after the branch. % 1.94/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.94/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.94/0.63 # Begin clausification derivation % 1.94/0.63 % 1.94/0.63 # End clausification derivation % 1.94/0.63 # Begin listing active clauses obtained from FOF to CNF conversion % 1.94/0.63 cnf(i_0_10, plain, (apply(i,X1)=X1)). % 1.94/0.63 cnf(i_0_11, plain, (fixed_point(X1)|apply(fixed_pt,X1)!=X1)). % 1.94/0.63 cnf(i_0_8, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 1.94/0.63 cnf(i_0_9, plain, (apply(apply(apply(c,X1),X2),X3)=apply(apply(X1,X3),X2))). % 1.94/0.63 cnf(i_0_7, plain, (apply(apply(apply(s,X1),X2),X3)=apply(apply(X1,X3),apply(X2,X3)))). % 1.94/0.63 cnf(i_0_12, negated_conjecture, (~fixed_point(apply(apply(apply(s,apply(b,X1)),i),apply(apply(s,apply(b,X1)),i))))). % 1.94/0.63 cnf(i_0_18, plain, (X4=X4)). % 1.94/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.94/0.63 # Begin printing tableau % 1.94/0.63 # Found 6 steps % 1.94/0.63 cnf(i_0_7, plain, (apply(apply(apply(s,X9),X2),X3)=apply(apply(X9,X3),apply(X2,X3))), inference(start_rule)). % 1.94/0.63 cnf(i_0_29, plain, (apply(apply(apply(s,X9),X2),X3)=apply(apply(X9,X3),apply(X2,X3))), inference(extension_rule, [i_0_21])). % 1.94/0.63 cnf(i_0_55, plain, (apply(apply(X9,X3),apply(X2,X3))!=apply(apply(apply(s,X9),X2),X3)), inference(closure_rule, [i_0_7])). % 1.94/0.63 cnf(i_0_53, plain, (apply(apply(apply(s,X9),X2),X3)=apply(apply(apply(s,X9),X2),X3)), inference(extension_rule, [i_0_22])). % 1.94/0.63 cnf(i_0_64, plain, (apply(i,X9)!=X9), inference(closure_rule, [i_0_10])). % 1.94/0.63 cnf(i_0_62, plain, (apply(apply(apply(apply(s,X9),X2),X3),apply(i,X9))=apply(apply(apply(apply(s,X9),X2),X3),X9)), inference(etableau_closure_rule, [i_0_62, ...])). % 1.94/0.63 # End printing tableau % 1.94/0.63 # SZS output end % 1.94/0.63 # Branches closed with saturation will be marked with an "s" % 1.94/0.63 # Child (20245) has found a proof. % 1.94/0.63 % 1.94/0.63 # Proof search is over... % 1.94/0.63 # Freeing feature tree %------------------------------------------------------------------------------