TSTP Solution File: LCL161-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL161-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 : n010.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:59 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL161-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 13:28:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 14 Number of unprocessed: 14
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 14 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 14 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 14 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 23 tableaux to operate on
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_26, plain, (not(truth)=falsehood)).
% 0.12/0.37 cnf(i_0_19, plain, (and_star(X1,falsehood)=falsehood)).
% 0.12/0.37 cnf(i_0_16, plain, (xor(X1,falsehood)=X1)).
% 0.12/0.37 cnf(i_0_18, plain, (and_star(X1,truth)=X1)).
% 0.12/0.37 cnf(i_0_17, plain, (xor(X1,X1)=falsehood)).
% 0.12/0.37 cnf(i_0_15, plain, (xor(X1,truth)=not(X1))).
% 0.12/0.37 cnf(i_0_20, plain, (and_star(X1,xor(truth,X1))=falsehood)).
% 0.12/0.37 cnf(i_0_24, plain, (and_star(and_star(X1,X2),X3)=and_star(X1,and_star(X2,X3)))).
% 0.12/0.37 cnf(i_0_21, plain, (xor(X1,xor(truth,X2))=xor(not(X1),X2))).
% 0.12/0.37 cnf(i_0_27, plain, (xor(truth,and_star(X1,xor(truth,X2)))=implies(X1,X2))).
% 0.12/0.37 cnf(i_0_23, plain, (xor(X1,X2)=xor(X2,X1))).
% 0.12/0.37 cnf(i_0_25, plain, (and_star(X1,X2)=and_star(X2,X1))).
% 0.12/0.37 cnf(i_0_22, plain, (and_star(X1,not(and_star(xor(truth,X2),X1)))=and_star(X2,not(and_star(xor(truth,X1),X2))))).
% 0.12/0.37 cnf(i_0_28, negated_conjecture, (implies(truth,x)!=x)).
% 0.12/0.37 cnf(i_0_30, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_26, plain, (not(truth)=falsehood), inference(start_rule)).
% 0.12/0.37 cnf(i_0_38, plain, (not(truth)=falsehood), inference(extension_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_69, plain, (not(truth)!=falsehood), inference(closure_rule, [i_0_26])).
% 0.12/0.37 cnf(i_0_68, plain, (implies(not(truth),not(truth))=implies(falsehood,falsehood)), inference(extension_rule, [i_0_33])).
% 0.12/0.37 cnf(i_0_77, plain, (implies(falsehood,falsehood)!=xor(implies(falsehood,falsehood),falsehood)), inference(closure_rule, [i_0_16])).
% 0.12/0.37 cnf(i_0_75, plain, (implies(not(truth),not(truth))=xor(implies(falsehood,falsehood),falsehood)), inference(etableau_closure_rule, [i_0_75, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (20858) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------