TSTP Solution File: COL061-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : COL061-1 : 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 : n018.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:44 EDT 2022
% Result : Unsatisfiable 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL061-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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 : n018.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 : Tue May 31 08:03:28 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___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 3 Number of unprocessed: 3
% 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 # 3 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 3 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 3 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 1
% 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 10 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 10 tableaux to operate on
% 0.13/0.40 # There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_5, plain, (apply(apply(t,X1),X2)=apply(X2,X1))).
% 0.13/0.40 cnf(i_0_4, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))).
% 0.13/0.40 cnf(i_0_6, negated_conjecture, (apply(apply(apply(X1,f(X1)),g(X1)),h(X1))!=apply(f(X1),apply(h(X1),g(X1))))).
% 0.13/0.40 cnf(i_0_8, plain, (X4=X4)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 6 steps
% 0.13/0.40 cnf(i_0_5, plain, (apply(apply(t,X11),apply(b,X1))=apply(apply(b,X1),X11)), inference(start_rule)).
% 0.13/0.40 cnf(i_0_16, plain, (apply(apply(t,X11),apply(b,X1))=apply(apply(b,X1),X11)), inference(extension_rule, [i_0_12])).
% 0.13/0.40 cnf(i_0_29, plain, (apply(apply(t,X1),X11)!=apply(X11,X1)), inference(closure_rule, [i_0_5])).
% 0.13/0.40 cnf(i_0_27, plain, (apply(apply(apply(t,X11),apply(b,X1)),apply(apply(t,X1),X11))=apply(apply(apply(b,X1),X11),apply(X11,X1))), inference(extension_rule, [i_0_11])).
% 0.13/0.40 cnf(i_0_42, plain, (apply(apply(apply(b,X1),X11),apply(X11,X1))!=apply(X1,apply(X11,apply(X11,X1)))), inference(closure_rule, [i_0_4])).
% 0.13/0.40 cnf(i_0_40, plain, (apply(apply(apply(t,X11),apply(b,X1)),apply(apply(t,X1),X11))=apply(X1,apply(X11,apply(X11,X1)))), inference(etableau_closure_rule, [i_0_40, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_5, plain, (apply(apply(t,X1),X2)=apply(X2,X1))).
% 0.13/0.40 cnf(i_0_4, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))).
% 0.13/0.40 cnf(i_0_6, negated_conjecture, (apply(apply(apply(X1,f(X1)),g(X1)),h(X1))!=apply(f(X1),apply(h(X1),g(X1))))).
% 0.13/0.40 cnf(i_0_8, plain, (X4=X4)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 6 steps
% 0.13/0.40 cnf(i_0_5, plain, (apply(apply(t,apply(t,X1)),apply(t,X1))=apply(apply(t,X1),apply(t,X1))), inference(start_rule)).
% 0.13/0.40 cnf(i_0_16, plain, (apply(apply(t,apply(t,X1)),apply(t,X1))=apply(apply(t,X1),apply(t,X1))), inference(extension_rule, [i_0_11])).
% 0.13/0.40 cnf(i_0_26, plain, (apply(apply(t,X1),apply(t,X1))!=apply(apply(t,X1),X1)), inference(closure_rule, [i_0_5])).
% 0.13/0.40 cnf(i_0_24, plain, (apply(apply(t,apply(t,X1)),apply(t,X1))=apply(apply(t,X1),X1)), inference(extension_rule, [i_0_11])).
% 0.13/0.40 cnf(i_0_42, plain, (apply(apply(t,X1),X1)!=apply(X1,X1)), inference(closure_rule, [i_0_5])).
% 0.13/0.40 cnf(i_0_40, plain, (apply(apply(t,apply(t,X1)),apply(t,X1))=apply(X1,X1)), inference(etableau_closure_rule, [i_0_40, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # Child (17915) has found a proof.
% 0.13/0.40
% 0.13/0.40 # Proof search is over...
% 0.13/0.40 # Freeing feature tree
%------------------------------------------------------------------------------