TSTP Solution File: COL066-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : COL066-3 : TPTP v8.1.0. Bugfixed 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 : n023.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:47 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL066-3 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.03/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 : n023.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 05:23:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_____Z1014__C12_02_nc_F1_AE_CS_SP_S2S
% 0.20/0.37 # and selection function SelectNewComplexAHP.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 4 Number of unprocessed: 4
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 4 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 1 conjectures.
% 0.20/0.37 # There are 1 start rule candidates:
% 0.20/0.37 # Found 4 unit axioms.
% 0.20/0.37 # 1 start rule tableaux created.
% 0.20/0.37 # 0 extension rule candidate clauses
% 0.20/0.37 # 4 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.37 # Creating equality axioms
% 0.20/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 8 tableaux to operate on
% 0.20/0.40 # There were 1 total branch saturation attempts.
% 0.20/0.40 # There were 0 of these attempts blocked.
% 0.20/0.40 # There were 0 deferred branch saturation attempts.
% 0.20/0.40 # There were 0 free duplicated saturations.
% 0.20/0.40 # There were 1 total successful branch saturations.
% 0.20/0.40 # There were 0 successful branch saturations in interreduction.
% 0.20/0.40 # There were 0 successful branch saturations on the branch.
% 0.20/0.40 # There were 1 successful branch saturations after the branch.
% 0.20/0.40 # There were 1 total branch saturation attempts.
% 0.20/0.40 # There were 0 of these attempts blocked.
% 0.20/0.40 # There were 0 deferred branch saturation attempts.
% 0.20/0.40 # There were 0 free duplicated saturations.
% 0.20/0.40 # There were 1 total successful branch saturations.
% 0.20/0.40 # There were 0 successful branch saturations in interreduction.
% 0.20/0.40 # There were 0 successful branch saturations on the branch.
% 0.20/0.40 # There were 1 successful branch saturations after the branch.
% 0.20/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40 # Begin clausification derivation
% 0.20/0.40
% 0.20/0.40 # End clausification derivation
% 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40 cnf(i_0_5, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))).
% 0.20/0.40 cnf(i_0_6, plain, (apply(apply(apply(q,X1),X2),X3)=apply(X2,apply(X1,X3)))).
% 0.20/0.40 cnf(i_0_7, plain, (apply(apply(w,X1),X2)=apply(apply(X1,X2),X2))).
% 0.20/0.40 cnf(i_0_8, negated_conjecture, (apply(apply(apply(w,apply(apply(w,apply(q,apply(q,q))),apply(q,x))),y),z)!=apply(apply(x,y),apply(apply(x,y),z)))).
% 0.20/0.40 cnf(i_0_10, plain, (X4=X4)).
% 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.40 # Begin printing tableau
% 0.20/0.40 # Found 6 steps
% 0.20/0.40 cnf(i_0_6, plain, (apply(apply(apply(q,X2),X2),X3)=apply(X2,apply(X2,X3))), inference(start_rule)).
% 0.20/0.40 cnf(i_0_16, plain, (apply(apply(apply(q,X2),X2),X3)=apply(X2,apply(X2,X3))), inference(extension_rule, [i_0_13])).
% 0.20/0.40 cnf(i_0_36, plain, (apply(apply(apply(b,X2),X2),X3)!=apply(X2,apply(X2,X3))), inference(closure_rule, [i_0_5])).
% 0.20/0.40 cnf(i_0_34, plain, (apply(apply(apply(q,X2),X2),X3)=apply(apply(apply(b,X2),X2),X3)), inference(extension_rule, [i_0_14])).
% 0.20/0.40 cnf(i_0_43, plain, (apply(apply(apply(b,X1),X2),X3)!=apply(X1,apply(X2,X3))), inference(closure_rule, [i_0_5])).
% 0.20/0.40 cnf(i_0_41, plain, (apply(apply(apply(apply(q,X2),X2),X3),apply(apply(apply(b,X1),X2),X3))=apply(apply(apply(apply(b,X2),X2),X3),apply(X1,apply(X2,X3)))), inference(etableau_closure_rule, [i_0_41, ...])).
% 0.20/0.40 # End printing tableau
% 0.20/0.40 # SZS output end
% 0.20/0.40 # Branches closed with saturation will be marked with an "s"
% 0.20/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40 # Begin clausification derivation
% 0.20/0.40
% 0.20/0.40 # End clausification derivation
% 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40 cnf(i_0_5, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))).
% 0.20/0.40 cnf(i_0_6, plain, (apply(apply(apply(q,X1),X2),X3)=apply(X2,apply(X1,X3)))).
% 0.20/0.40 cnf(i_0_7, plain, (apply(apply(w,X1),X2)=apply(apply(X1,X2),X2))).
% 0.20/0.40 cnf(i_0_8, negated_conjecture, (apply(apply(apply(w,apply(apply(w,apply(q,apply(q,q))),apply(q,x))),y),z)!=apply(apply(x,y),apply(apply(x,y),z)))).
% 0.20/0.40 cnf(i_0_10, plain, (X4=X4)).
% 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.40 # Begin printing tableau
% 0.20/0.40 # Found 6 steps
% 0.20/0.40 cnf(i_0_5, plain, (apply(apply(apply(b,apply(x,y)),apply(x,y)),z)=apply(apply(x,y),apply(apply(x,y),z))), inference(start_rule)).
% 0.20/0.40 cnf(i_0_15, plain, (apply(apply(apply(b,apply(x,y)),apply(x,y)),z)=apply(apply(x,y),apply(apply(x,y),z))), inference(extension_rule, [i_0_13])).
% 0.20/0.40 cnf(i_0_24, plain, (apply(apply(apply(w,apply(apply(w,apply(q,apply(q,q))),apply(q,x))),y),z)=apply(apply(x,y),apply(apply(x,y),z))), inference(closure_rule, [i_0_8])).
% 0.20/0.40 cnf(i_0_25, plain, (apply(apply(apply(w,apply(apply(w,apply(q,apply(q,q))),apply(q,x))),y),z)!=apply(apply(apply(b,apply(x,y)),apply(x,y)),z)), inference(extension_rule, [i_0_14])).
% 0.20/0.40 cnf(i_0_76, plain, ($false), inference(closure_rule, [i_0_10])).
% 0.20/0.40 cnf(i_0_75, plain, (apply(apply(w,apply(apply(w,apply(q,apply(q,q))),apply(q,x))),y)!=apply(apply(b,apply(x,y)),apply(x,y))), inference(etableau_closure_rule, [i_0_75, ...])).
% 0.20/0.40 # End printing tableau
% 0.20/0.40 # SZS output end
% 0.20/0.40 # Branches closed with saturation will be marked with an "s"
% 0.20/0.40 # Child (31248) has found a proof.
% 0.20/0.40
% 0.20/0.40 # Proof search is over...
% 0.20/0.40 # Freeing feature tree
%------------------------------------------------------------------------------