TSTP Solution File: COM002-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : COM002-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 : n027.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 01:14:49 EDT 2022
% Result : Unsatisfiable 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM002-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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 16 18:21:05 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.14/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 19 Number of unprocessed: 19
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 19 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 1 conjectures.
% 0.14/0.37 # There are 1 start rule candidates:
% 0.14/0.37 # Found 15 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 4 extension rule candidate clauses
% 0.14/0.37 # 15 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 8 tableaux to operate on
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_28, hypothesis, (follows(p3,p2))).
% 0.14/0.38 cnf(i_0_32, hypothesis, (follows(p6,p3))).
% 0.14/0.38 cnf(i_0_27, hypothesis, (labels(loop,p3))).
% 0.14/0.38 cnf(i_0_25, hypothesis, (follows(p2,p1))).
% 0.14/0.38 cnf(i_0_31, hypothesis, (follows(p5,p4))).
% 0.14/0.38 cnf(i_0_34, hypothesis, (follows(p7,p6))).
% 0.14/0.38 cnf(i_0_36, hypothesis, (follows(p8,p7))).
% 0.14/0.38 cnf(i_0_30, hypothesis, (has(p4,goto(out)))).
% 0.14/0.38 cnf(i_0_37, hypothesis, (has(p8,goto(loop)))).
% 0.14/0.38 cnf(i_0_24, hypothesis, (has(p1,assign(register_j,n0)))).
% 0.14/0.38 cnf(i_0_26, hypothesis, (has(p2,assign(register_k,n1)))).
% 0.14/0.38 cnf(i_0_29, hypothesis, (has(p3,ifthen(equal_function(register_j,n),p4)))).
% 0.14/0.38 cnf(i_0_33, hypothesis, (has(p6,assign(register_k,times(n2,register_k))))).
% 0.14/0.38 cnf(i_0_35, hypothesis, (has(p7,assign(register_j,plus(register_j,n1))))).
% 0.14/0.38 cnf(i_0_38, negated_conjecture, (~succeeds(p3,p3))).
% 0.14/0.38 cnf(i_0_20, plain, (succeeds(X1,X2)|~follows(X1,X2))).
% 0.14/0.38 cnf(i_0_23, plain, (succeeds(X1,X2)|~has(X2,ifthen(X3,X1)))).
% 0.14/0.38 cnf(i_0_21, plain, (succeeds(X1,X2)|~succeeds(X3,X2)|~succeeds(X1,X3))).
% 0.14/0.38 cnf(i_0_22, plain, (succeeds(X1,X2)|~labels(X3,X1)|~has(X2,goto(X3)))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 7 steps
% 0.14/0.38 cnf(i_0_38, negated_conjecture, (~succeeds(p3,p3)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_39, plain, (~succeeds(p3,p3)), inference(extension_rule, [i_0_21])).
% 0.14/0.38 cnf(i_0_46, plain, (~succeeds(p3,p8)), inference(extension_rule, [i_0_22])).
% 0.14/0.38 cnf(i_0_78, plain, (~labels(loop,p3)), inference(closure_rule, [i_0_27])).
% 0.14/0.38 cnf(i_0_79, plain, (~has(p8,goto(loop))), inference(closure_rule, [i_0_37])).
% 0.14/0.38 cnf(i_0_45, plain, (~succeeds(p8,p3)), inference(extension_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_81, plain, (~follows(p8,p3)), inference(etableau_closure_rule, [i_0_81, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_28, hypothesis, (follows(p3,p2))).
% 0.14/0.38 cnf(i_0_32, hypothesis, (follows(p6,p3))).
% 0.14/0.38 cnf(i_0_27, hypothesis, (labels(loop,p3))).
% 0.14/0.38 cnf(i_0_25, hypothesis, (follows(p2,p1))).
% 0.14/0.38 cnf(i_0_31, hypothesis, (follows(p5,p4))).
% 0.14/0.38 cnf(i_0_34, hypothesis, (follows(p7,p6))).
% 0.14/0.38 cnf(i_0_36, hypothesis, (follows(p8,p7))).
% 0.14/0.38 cnf(i_0_30, hypothesis, (has(p4,goto(out)))).
% 0.14/0.38 cnf(i_0_37, hypothesis, (has(p8,goto(loop)))).
% 0.14/0.38 cnf(i_0_24, hypothesis, (has(p1,assign(register_j,n0)))).
% 0.14/0.38 cnf(i_0_26, hypothesis, (has(p2,assign(register_k,n1)))).
% 0.14/0.38 cnf(i_0_29, hypothesis, (has(p3,ifthen(equal_function(register_j,n),p4)))).
% 0.14/0.38 cnf(i_0_33, hypothesis, (has(p6,assign(register_k,times(n2,register_k))))).
% 0.14/0.38 cnf(i_0_35, hypothesis, (has(p7,assign(register_j,plus(register_j,n1))))).
% 0.14/0.38 cnf(i_0_38, negated_conjecture, (~succeeds(p3,p3))).
% 0.14/0.38 cnf(i_0_20, plain, (succeeds(X1,X2)|~follows(X1,X2))).
% 0.14/0.38 cnf(i_0_23, plain, (succeeds(X1,X2)|~has(X2,ifthen(X3,X1)))).
% 0.14/0.38 cnf(i_0_21, plain, (succeeds(X1,X2)|~succeeds(X3,X2)|~succeeds(X1,X3))).
% 0.14/0.38 cnf(i_0_22, plain, (succeeds(X1,X2)|~labels(X3,X1)|~has(X2,goto(X3)))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_38, negated_conjecture, (~succeeds(p3,p3)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_39, plain, (~succeeds(p3,p3)), inference(extension_rule, [i_0_21])).
% 0.14/0.38 cnf(i_0_46, plain, (~succeeds(p3,p2)), inference(extension_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_71, plain, (~follows(p3,p2)), inference(closure_rule, [i_0_28])).
% 0.14/0.38 cnf(i_0_45, plain, (~succeeds(p2,p3)), inference(extension_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_81, plain, (~follows(p2,p3)), inference(etableau_closure_rule, [i_0_81, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_28, hypothesis, (follows(p3,p2))).
% 0.14/0.38 cnf(i_0_32, hypothesis, (follows(p6,p3))).
% 0.14/0.38 cnf(i_0_27, hypothesis, (labels(loop,p3))).
% 0.14/0.38 cnf(i_0_25, hypothesis, (follows(p2,p1))).
% 0.14/0.38 cnf(i_0_31, hypothesis, (follows(p5,p4))).
% 0.14/0.38 cnf(i_0_34, hypothesis, (follows(p7,p6))).
% 0.14/0.38 cnf(i_0_36, hypothesis, (follows(p8,p7))).
% 0.14/0.38 cnf(i_0_30, hypothesis, (has(p4,goto(out)))).
% 0.14/0.38 cnf(i_0_37, hypothesis, (has(p8,goto(loop)))).
% 0.14/0.38 cnf(i_0_24, hypothesis, (has(p1,assign(register_j,n0)))).
% 0.14/0.38 cnf(i_0_26, hypothesis, (has(p2,assign(register_k,n1)))).
% 0.14/0.38 cnf(i_0_29, hypothesis, (has(p3,ifthen(equal_function(register_j,n),p4)))).
% 0.14/0.38 cnf(i_0_33, hypothesis, (has(p6,assign(register_k,times(n2,register_k))))).
% 0.14/0.38 cnf(i_0_35, hypothesis, (has(p7,assign(register_j,plus(register_j,n1))))).
% 0.14/0.38 cnf(i_0_38, negated_conjecture, (~succeeds(p3,p3))).
% 0.14/0.38 cnf(i_0_20, plain, (succeeds(X1,X2)|~follows(X1,X2))).
% 0.14/0.38 cnf(i_0_23, plain, (succeeds(X1,X2)|~has(X2,ifthen(X3,X1)))).
% 0.14/0.38 cnf(i_0_21, plain, (succeeds(X1,X2)|~succeeds(X3,X2)|~succeeds(X1,X3))).
% 0.14/0.38 cnf(i_0_22, plain, (succeeds(X1,X2)|~labels(X3,X1)|~has(X2,goto(X3)))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_38, negated_conjecture, (~succeeds(p3,p3)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_39, plain, (~succeeds(p3,p3)), inference(extension_rule, [i_0_21])).
% 0.14/0.38 cnf(i_0_45, plain, (~succeeds(p4,p3)), inference(extension_rule, [i_0_23])).
% 0.14/0.38 cnf(i_0_63, plain, (~has(p3,ifthen(equal_function(register_j,n),p4))), inference(closure_rule, [i_0_29])).
% 0.14/0.38 cnf(i_0_46, plain, (~succeeds(p3,p4)), inference(extension_rule, [i_0_20])).
% 0.14/0.38 cnf(i_0_81, plain, (~follows(p3,p4)), inference(etableau_closure_rule, [i_0_81, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (9703) has found a proof.
% 0.14/0.38
% 0.14/0.38 # Proof search is over...
% 0.14/0.38 # Freeing feature tree
%------------------------------------------------------------------------------