TSTP Solution File: LCL154-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL154-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 : n026.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 : Sun Jul 17 10:19:57 EDT 2022
% Result : Unsatisfiable 0.18s 0.40s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL154-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.32 % Computer : n026.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Sun Jul 3 12:23:51 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.13/0.38 # and selection function SelectNewComplexAHP.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 17 Number of unprocessed: 15
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 15 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 1 conjectures.
% 0.13/0.38 # There are 1 start rule candidates:
% 0.13/0.38 # Found 15 unit axioms.
% 0.13/0.38 # 1 start rule tableaux created.
% 0.13/0.38 # 0 extension rule candidate clauses
% 0.13/0.38 # 15 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.38 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.38 # Returning from population with 28 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 28 tableaux to operate on
% 0.18/0.40 # There were 1 total branch saturation attempts.
% 0.18/0.40 # There were 0 of these attempts blocked.
% 0.18/0.40 # There were 0 deferred branch saturation attempts.
% 0.18/0.40 # There were 0 free duplicated saturations.
% 0.18/0.40 # There were 1 total successful branch saturations.
% 0.18/0.40 # There were 0 successful branch saturations in interreduction.
% 0.18/0.40 # There were 0 successful branch saturations on the branch.
% 0.18/0.40 # There were 1 successful branch saturations after the branch.
% 0.18/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 # Begin clausification derivation
% 0.18/0.40
% 0.18/0.40 # End clausification derivation
% 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.40 cnf(i_0_33, plain, (not(truth)=falsehood)).
% 0.18/0.40 cnf(i_0_18, plain, (implies(truth,X1)=X1)).
% 0.18/0.40 cnf(i_0_22, plain, (implies(not(X1),X2)=or(X1,X2))).
% 0.18/0.40 cnf(i_0_23, plain, (or(or(X1,X2),X3)=or(X1,or(X2,X3)))).
% 0.18/0.40 cnf(i_0_31, plain, (and_star(and_star(X1,X2),X3)=and_star(X1,and_star(X2,X3)))).
% 0.18/0.40 cnf(i_0_30, plain, (and(X1,X2)=and_star(X1,X2))).
% 0.18/0.40 cnf(i_0_25, plain, (not(or(not(X1),not(X2)))=and_star(X1,X2))).
% 0.18/0.40 cnf(i_0_21, plain, (implies(or(X1,not(X2)),implies(X2,X1))=truth)).
% 0.18/0.40 cnf(i_0_28, plain, (or(and_star(X1,not(X2)),and_star(not(X1),X2))=xor(X1,X2))).
% 0.18/0.40 cnf(i_0_19, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)).
% 0.18/0.40 cnf(i_0_24, plain, (or(X1,X2)=or(X2,X1))).
% 0.18/0.40 cnf(i_0_29, plain, (xor(X1,X2)=xor(X2,X1))).
% 0.18/0.40 cnf(i_0_32, plain, (and_star(X1,X2)=and_star(X2,X1))).
% 0.18/0.40 cnf(i_0_20, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))).
% 0.18/0.40 cnf(i_0_34, negated_conjecture, (xor(falsehood,x)!=x)).
% 0.18/0.40 cnf(i_0_36, plain, (X4=X4)).
% 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.40 # Begin printing tableau
% 0.18/0.40 # Found 6 steps
% 0.18/0.40 cnf(i_0_33, plain, (not(truth)=falsehood), inference(start_rule)).
% 0.18/0.40 cnf(i_0_46, plain, (not(truth)=falsehood), inference(extension_rule, [i_0_44])).
% 0.18/0.40 cnf(i_0_81, plain, (not(truth)!=falsehood), inference(closure_rule, [i_0_33])).
% 0.18/0.40 cnf(i_0_80, plain, (xor(not(truth),not(truth))=xor(falsehood,falsehood)), inference(extension_rule, [i_0_39])).
% 0.18/0.40 cnf(i_0_92, plain, (xor(falsehood,falsehood)!=implies(truth,xor(falsehood,falsehood))), inference(closure_rule, [i_0_18])).
% 0.18/0.40 cnf(i_0_90, plain, (xor(not(truth),not(truth))=implies(truth,xor(falsehood,falsehood))), inference(etableau_closure_rule, [i_0_90, ...])).
% 0.18/0.40 # End printing tableau
% 0.18/0.40 # SZS output end
% 0.18/0.40 # Branches closed with saturation will be marked with an "s"
% 0.18/0.40 # There were 1 total branch saturation attempts.
% 0.18/0.40 # There were 0 of these attempts blocked.
% 0.18/0.40 # There were 0 deferred branch saturation attempts.
% 0.18/0.40 # There were 0 free duplicated saturations.
% 0.18/0.40 # There were 1 total successful branch saturations.
% 0.18/0.40 # There were 0 successful branch saturations in interreduction.
% 0.18/0.40 # There were 0 successful branch saturations on the branch.
% 0.18/0.40 # There were 1 successful branch saturations after the branch.
% 0.18/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.40 # Begin clausification derivation
% 0.18/0.40
% 0.18/0.40 # End clausification derivation
% 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.40 cnf(i_0_33, plain, (not(truth)=falsehood)).
% 0.18/0.40 cnf(i_0_18, plain, (implies(truth,X1)=X1)).
% 0.18/0.40 cnf(i_0_22, plain, (implies(not(X1),X2)=or(X1,X2))).
% 0.18/0.40 cnf(i_0_23, plain, (or(or(X1,X2),X3)=or(X1,or(X2,X3)))).
% 0.18/0.40 cnf(i_0_31, plain, (and_star(and_star(X1,X2),X3)=and_star(X1,and_star(X2,X3)))).
% 0.18/0.40 cnf(i_0_30, plain, (and(X1,X2)=and_star(X1,X2))).
% 0.18/0.40 cnf(i_0_25, plain, (not(or(not(X1),not(X2)))=and_star(X1,X2))).
% 0.18/0.40 cnf(i_0_21, plain, (implies(or(X1,not(X2)),implies(X2,X1))=truth)).
% 0.18/0.40 cnf(i_0_28, plain, (or(and_star(X1,not(X2)),and_star(not(X1),X2))=xor(X1,X2))).
% 0.18/0.40 cnf(i_0_19, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)).
% 0.18/0.40 cnf(i_0_24, plain, (or(X1,X2)=or(X2,X1))).
% 0.18/0.40 cnf(i_0_29, plain, (xor(X1,X2)=xor(X2,X1))).
% 0.18/0.40 cnf(i_0_32, plain, (and_star(X1,X2)=and_star(X2,X1))).
% 0.18/0.40 cnf(i_0_20, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))).
% 0.18/0.40 cnf(i_0_34, negated_conjecture, (xor(falsehood,x)!=x)).
% 0.18/0.40 cnf(i_0_36, plain, (X4=X4)).
% 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.40 # Begin printing tableau
% 0.18/0.40 # Found 6 steps
% 0.18/0.40 cnf(i_0_33, plain, (not(truth)=falsehood), inference(start_rule)).
% 0.18/0.40 cnf(i_0_46, plain, (not(truth)=falsehood), inference(extension_rule, [i_0_45])).
% 0.18/0.40 cnf(i_0_84, plain, (not(truth)!=falsehood), inference(closure_rule, [i_0_33])).
% 0.18/0.40 cnf(i_0_83, plain, (and_star(not(truth),not(truth))=and_star(falsehood,falsehood)), inference(extension_rule, [i_0_39])).
% 0.18/0.40 cnf(i_0_92, plain, (and_star(falsehood,falsehood)!=implies(truth,and_star(falsehood,falsehood))), inference(closure_rule, [i_0_18])).
% 0.18/0.40 cnf(i_0_90, plain, (and_star(not(truth),not(truth))=implies(truth,and_star(falsehood,falsehood))), inference(etableau_closure_rule, [i_0_90, ...])).
% 0.18/0.40 # End printing tableau
% 0.18/0.40 # SZS output end
% 0.18/0.40 # Branches closed with saturation will be marked with an "s"
% 0.18/0.40 # Child (5078) has found a proof.
% 0.18/0.40
% 0.18/0.40 # Proof search is over...
% 0.18/0.40 # Freeing feature tree
%------------------------------------------------------------------------------