TSTP Solution File: LCL109-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL109-10 : TPTP v8.1.0. Released v7.5.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 : n020.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:36 EDT 2022
% Result : Unsatisfiable 53.29s 7.05s
% Output : CNFRefutation 53.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL109-10 : TPTP v8.1.0. Released v7.5.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 : n020.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 : Sun Jul 3 09:00:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.20/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Number of axioms: 16 Number of unprocessed: 16
% 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 # 16 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 16 unit axioms.
% 0.20/0.37 # 1 start rule tableaux created.
% 0.20/0.37 # 0 extension rule candidate clauses
% 0.20/0.37 # 16 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 24 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 24 tableaux to operate on
% 53.29/7.05 # There were 1 total branch saturation attempts.
% 53.29/7.05 # There were 0 of these attempts blocked.
% 53.29/7.05 # There were 0 deferred branch saturation attempts.
% 53.29/7.05 # There were 0 free duplicated saturations.
% 53.29/7.05 # There were 1 total successful branch saturations.
% 53.29/7.05 # There were 0 successful branch saturations in interreduction.
% 53.29/7.05 # There were 0 successful branch saturations on the branch.
% 53.29/7.05 # There were 1 successful branch saturations after the branch.
% 53.29/7.05 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 53.29/7.05 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 53.29/7.05 # Begin clausification derivation
% 53.29/7.05
% 53.29/7.05 # End clausification derivation
% 53.29/7.05 # Begin listing active clauses obtained from FOF to CNF conversion
% 53.29/7.05 cnf(i_0_30, plain, (not(not(X1))=X1)).
% 53.29/7.05 cnf(i_0_24, plain, (implies(X1,truth)=truth)).
% 53.29/7.05 cnf(i_0_18, plain, (implies(truth,X1)=X1)).
% 53.29/7.05 cnf(i_0_22, plain, (implies(X1,X1)=truth)).
% 53.29/7.05 cnf(i_0_29, plain, (implies(X1,not(truth))=not(X1))).
% 53.29/7.05 cnf(i_0_25, plain, (implies(X1,implies(X2,X1))=truth)).
% 53.29/7.05 cnf(i_0_31, plain, (implies(not(X1),not(X2))=implies(X2,X1))).
% 53.29/7.05 cnf(i_0_28, plain, (implies(X1,implies(X2,X3))=implies(X2,implies(X1,X3)))).
% 53.29/7.05 cnf(i_0_20, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))).
% 53.29/7.05 cnf(i_0_21, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)).
% 53.29/7.05 cnf(i_0_27, plain, (implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))=truth)).
% 53.29/7.05 cnf(i_0_19, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)).
% 53.29/7.05 cnf(i_0_32, negated_conjecture, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=truth)).
% 53.29/7.05 cnf(i_0_17, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 53.29/7.05 cnf(i_0_23, plain, (ifeq(implies(X1,X2),implies(X2,X1),X1,X2)=X2)).
% 53.29/7.05 cnf(i_0_26, plain, (ifeq(implies(X1,X2),implies(X2,X3),implies(X1,X3),truth)=truth)).
% 53.29/7.05 cnf(i_0_34, plain, (X4=X4)).
% 53.29/7.05 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 53.29/7.05 # Begin printing tableau
% 53.29/7.05 # Found 6 steps
% 53.29/7.05 cnf(i_0_30, plain, (not(not(truth))=truth), inference(start_rule)).
% 53.29/7.05 cnf(i_0_41, plain, (not(not(truth))=truth), inference(extension_rule, [i_0_37])).
% 53.29/7.05 cnf(i_0_62, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))=truth), inference(closure_rule, [i_0_32])).
% 53.29/7.05 cnf(i_0_63, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=not(not(truth))), inference(extension_rule, [i_0_37])).
% 53.29/7.05 cnf(i_0_80, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=not(not(implies(implies(implies(a,b),implies(b,a)),implies(b,a))))), inference(closure_rule, [i_0_30])).
% 53.29/7.05 cnf(i_0_81, plain, (not(not(implies(implies(implies(a,b),implies(b,a)),implies(b,a))))!=not(not(truth))), inference(etableau_closure_rule, [i_0_81, ...])).
% 53.29/7.05 # End printing tableau
% 53.29/7.05 # SZS output end
% 53.29/7.05 # Branches closed with saturation will be marked with an "s"
% 53.29/7.07 # Child (8746) has found a proof.
% 53.29/7.07
% 53.29/7.07 # Proof search is over...
% 53.29/7.07 # Freeing feature tree
%------------------------------------------------------------------------------