%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL078-2 : TPTP v8.1.0. Released v1.2.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 : n019.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:49 EDT 2022 % Result : Unsatisfiable 0.13s 0.34s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.09 % Problem : COL078-2 : TPTP v8.1.0. Released v1.2.0. % 0.04/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.29 % Computer : n019.cluster.edu % 0.08/0.29 % Model : x86_64 x86_64 % 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.29 % Memory : 8042.1875MB % 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.29 % CPULimit : 300 % 0.08/0.29 % WCLimit : 600 % 0.08/0.29 % DateTime : Tue May 31 07:06:10 EDT 2022 % 0.08/0.29 % CPUTime : % 0.13/0.32 # No SInE strategy applied % 0.13/0.32 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.32 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.32 # % 0.13/0.32 # Presaturation interreduction done % 0.13/0.32 # Number of axioms: 5 Number of unprocessed: 5 % 0.13/0.32 # Tableaux proof search. % 0.13/0.32 # APR header successfully linked. % 0.13/0.32 # Hello from C++ % 0.13/0.34 # The folding up rule is enabled... % 0.13/0.34 # Local unification is enabled... % 0.13/0.34 # Any saturation attempts will use folding labels... % 0.13/0.34 # 5 beginning clauses after preprocessing and clausification % 0.13/0.34 # Creating start rules for all 1 conjectures. % 0.13/0.34 # There are 1 start rule candidates: % 0.13/0.34 # Found 4 unit axioms. % 0.13/0.34 # 1 start rule tableaux created. % 0.13/0.34 # 1 extension rule candidate clauses % 0.13/0.34 # 4 unit axiom clauses % 0.13/0.34 % 0.13/0.34 # Requested 8, 32 cores available to the main process. % 0.13/0.34 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.34 # There were 1 total branch saturation attempts. % 0.13/0.34 # There were 0 of these attempts blocked. % 0.13/0.34 # There were 0 deferred branch saturation attempts. % 0.13/0.34 # There were 0 free duplicated saturations. % 0.13/0.34 # There were 1 total successful branch saturations. % 0.13/0.34 # There were 0 successful branch saturations in interreduction. % 0.13/0.34 # There were 0 successful branch saturations on the branch. % 0.13/0.34 # There were 1 successful branch saturations after the branch. % 0.13/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.34 # Begin clausification derivation % 0.13/0.34 % 0.13/0.34 # End clausification derivation % 0.13/0.34 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.34 cnf(i_0_9, plain, (apply(identity,X1)=X1)). % 0.13/0.34 cnf(i_0_6, plain, (apply(k(X1),X2)=X1)). % 0.13/0.34 cnf(i_0_7, plain, (apply(apply(X1,k(X2)),apply(X3,X2))=apply(apply(apply(abstraction,X1),X3),X2))). % 0.13/0.34 cnf(i_0_10, negated_conjecture, (k(k(identity))!=apply(apply(apply(abstraction,abstraction),abstraction),abstraction))). % 0.13/0.34 cnf(i_0_8, plain, (X1=X2|apply(X1,n(X1,X2))!=apply(X2,n(X1,X2)))). % 0.13/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.34 # Begin printing tableau % 0.13/0.34 # Found 4 steps % 0.13/0.34 cnf(i_0_10, negated_conjecture, (k(k(identity))!=apply(apply(apply(abstraction,abstraction),abstraction),abstraction)), inference(start_rule)). % 0.13/0.34 cnf(i_0_11, plain, (k(k(identity))!=apply(apply(apply(abstraction,abstraction),abstraction),abstraction)), inference(extension_rule, [i_0_8])). % 0.13/0.34 cnf(i_0_13, plain, (apply(k(k(identity)),n(k(k(identity)),apply(apply(apply(abstraction,abstraction),abstraction),abstraction)))!=apply(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),n(k(k(identity)),apply(apply(apply(abstraction,abstraction),abstraction),abstraction)))), inference(extension_rule, [i_0_8])). % 0.13/0.34 cnf(i_0_15, plain, (apply(apply(k(k(identity)),n(k(k(identity)),apply(apply(apply(abstraction,abstraction),abstraction),abstraction))),n(apply(k(k(identity)),n(k(k(identity)),apply(apply(apply(abstraction,abstraction),abstraction),abstraction))),apply(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),n(k(k(identity)),apply(apply(apply(abstraction,abstraction),abstraction),abstraction)))))!=apply(apply(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),n(k(k(identity)),apply(apply(apply(abstraction,abstraction),abstraction),abstraction))),n(apply(k(k(identity)),n(k(k(identity)),apply(apply(apply(abstraction,abstraction),abstraction),abstraction))),apply(apply(apply(apply(abstraction,abstraction),abstraction),abstraction),n(k(k(identity)),apply(apply(apply(abstraction,abstraction),abstraction),abstraction)))))), inference(etableau_closure_rule, [i_0_15, ...])). % 0.13/0.34 # End printing tableau % 0.13/0.34 # SZS output end % 0.13/0.34 # Branches closed with saturation will be marked with an "s" % 0.13/0.34 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.13/0.34 # We now have 1 tableaux to operate on % 0.13/0.34 # Found closed tableau during pool population. % 0.13/0.34 # Proof search is over... % 0.13/0.34 # Freeing feature tree %------------------------------------------------------------------------------