TSTP Solution File: LCL109-5 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL109-5 : 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 : n021.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:39 EDT 2022
% Result : Unsatisfiable 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL109-5 : TPTP v8.1.0. Released v1.0.0.
% 0.04/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 : n021.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 : Sat Jul 2 09:42:45 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 15 Number of unprocessed: 14
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 14 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 1 conjectures.
% 0.19/0.38 # There are 1 start rule candidates:
% 0.19/0.38 # Found 9 unit axioms.
% 0.19/0.38 # 1 start rule tableaux created.
% 0.19/0.38 # 5 extension rule candidate clauses
% 0.19/0.38 # 9 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_18, plain, (implies(truth,X1)=X1)).
% 0.19/0.38 cnf(i_0_21, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)).
% 0.19/0.38 cnf(i_0_19, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)).
% 0.19/0.38 cnf(i_0_31, plain, (not(not(implies(implies(not(X1),not(X2)),not(X2))))=implies(implies(not(X1),not(X2)),not(X2)))).
% 0.19/0.38 cnf(i_0_30, plain, (not(implies(implies(not(not(X1)),not(not(X2))),not(not(X2))))=not(implies(implies(X1,X2),X2)))).
% 0.19/0.38 cnf(i_0_32, plain, (not(implies(implies(not(implies(X1,X2)),not(implies(X3,X2))),not(implies(X3,X2))))=implies(implies(implies(X1,X3),X3),X2))).
% 0.19/0.38 cnf(i_0_33, plain, (not(implies(implies(not(implies(X1,X2)),not(implies(X1,X3))),not(implies(X1,X3))))=implies(X1,not(implies(implies(not(X2),not(X3)),not(X3)))))).
% 0.19/0.38 cnf(i_0_20, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))).
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (implies(implies(implies(x,y),implies(y,x)),implies(y,x))!=truth)).
% 0.19/0.38 cnf(i_0_24, plain, (implies(X1,X2)=truth|~ordered(X1,X2))).
% 0.19/0.38 cnf(i_0_25, plain, (ordered(X1,X2)|implies(X1,X2)!=truth)).
% 0.19/0.38 cnf(i_0_28, plain, (ordered(X1,implies(X2,X3))|~ordered(X2,implies(X1,X3)))).
% 0.19/0.38 cnf(i_0_27, plain, (ordered(implies(X1,X2),implies(X1,X3))|~ordered(X2,X3))).
% 0.19/0.38 cnf(i_0_26, plain, (ordered(implies(X1,X2),implies(X3,X2))|~ordered(X1,X3))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 4 steps
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (implies(implies(implies(x,y),implies(y,x)),implies(y,x))!=truth), inference(start_rule)).
% 0.19/0.38 cnf(i_0_35, plain, (implies(implies(implies(x,y),implies(y,x)),implies(y,x))!=truth), inference(extension_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_37, plain, (~ordered(implies(implies(x,y),implies(y,x)),implies(y,x))), inference(extension_rule, [i_0_28])).
% 0.19/0.38 cnf(i_0_51, plain, (~ordered(y,implies(implies(implies(x,y),implies(y,x)),x))), inference(etableau_closure_rule, [i_0_51, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.38 # We now have 1 tableaux to operate on
% 0.19/0.38 # Found closed tableau during pool population.
% 0.19/0.38 # Proof search is over...
% 0.19/0.38 # Freeing feature tree
%------------------------------------------------------------------------------