TSTP Solution File: LCL223-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL223-1 : TPTP v8.1.0. Released v1.1.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 : n017.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:20:41 EDT 2022
% Result : Unsatisfiable 5.62s 5.88s
% Output : CNFRefutation 5.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL223-1 : TPTP v8.1.0. Released v1.1.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.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 10:11:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.38 # No SInE strategy applied
% 0.18/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.18/0.38 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.18/0.38 #
% 0.18/0.38 # Number of axioms: 9 Number of unprocessed: 9
% 0.18/0.38 # Tableaux proof search.
% 0.18/0.38 # APR header successfully linked.
% 0.18/0.38 # Hello from C++
% 1.81/2.00 # The folding up rule is enabled...
% 1.81/2.00 # Local unification is enabled...
% 1.81/2.00 # Any saturation attempts will use folding labels...
% 1.81/2.00 # 9 beginning clauses after preprocessing and clausification
% 1.81/2.00 # Creating start rules for all 1 conjectures.
% 1.81/2.00 # There are 1 start rule candidates:
% 1.81/2.00 # Found 6 unit axioms.
% 1.81/2.00 # 1 start rule tableaux created.
% 1.81/2.00 # 3 extension rule candidate clauses
% 1.81/2.00 # 6 unit axiom clauses
% 1.81/2.00
% 1.81/2.00 # Requested 8, 32 cores available to the main process.
% 1.81/2.00 # There are not enough tableaux to fork, creating more from the initial 1
% 5.62/5.88 # There were 4 total branch saturation attempts.
% 5.62/5.88 # There were 0 of these attempts blocked.
% 5.62/5.88 # There were 0 deferred branch saturation attempts.
% 5.62/5.88 # There were 0 free duplicated saturations.
% 5.62/5.88 # There were 1 total successful branch saturations.
% 5.62/5.88 # There were 0 successful branch saturations in interreduction.
% 5.62/5.88 # There were 0 successful branch saturations on the branch.
% 5.62/5.88 # There were 1 successful branch saturations after the branch.
% 5.62/5.88 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.62/5.88 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.62/5.88 # Begin clausification derivation
% 5.62/5.88
% 5.62/5.88 # End clausification derivation
% 5.62/5.88 # Begin listing active clauses obtained from FOF to CNF conversion
% 5.62/5.88 cnf(i_0_15, plain, (theorem(X1)|~axiom(X1))).
% 5.62/5.88 cnf(i_0_16, plain, (theorem(X1)|~theorem(X2)|~axiom(or(not(X2),X1)))).
% 5.62/5.88 cnf(i_0_11, plain, (axiom(or(not(X1),or(X2,X1))))).
% 5.62/5.88 cnf(i_0_10, plain, (axiom(or(not(or(X1,X1)),X1)))).
% 5.62/5.88 cnf(i_0_17, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2)))).
% 5.62/5.88 cnf(i_0_12, plain, (axiom(or(not(or(X1,X2)),or(X2,X1))))).
% 5.62/5.88 cnf(i_0_13, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))))).
% 5.62/5.88 cnf(i_0_14, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))))).
% 5.62/5.88 cnf(i_0_18, negated_conjecture, (~theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r)))))).
% 5.62/5.88 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 5.62/5.88 # Begin printing tableau
% 5.62/5.88 # Found 7 steps
% 5.62/5.88 cnf(i_0_18, negated_conjecture, (~theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r))))), inference(start_rule)).
% 5.62/5.88 cnf(i_0_19, plain, (~theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r))))), inference(extension_rule, [i_0_17])).
% 5.62/5.88 cnf(i_0_26, plain, (~axiom(or(not(or(p,q)),or(X4,or(p,q))))), inference(closure_rule, [i_0_11])).
% 5.62/5.88 cnf(i_0_27, plain, (~theorem(or(not(or(X4,or(p,q))),or(not(or(p,or(not(q),r))),or(p,r))))), inference(extension_rule, [i_0_17])).
% 5.62/5.88 cnf(i_0_213744, plain, (~axiom(or(not(or(X4,or(p,q))),or(X5,or(X4,or(p,q)))))), inference(closure_rule, [i_0_11])).
% 5.62/5.88 cnf(i_0_213745, plain, (~theorem(or(not(or(X5,or(X4,or(p,q)))),or(not(or(p,or(not(q),r))),or(p,r))))), inference(extension_rule, [i_0_15])).
% 5.62/5.88 cnf(i_0_305267, plain, (~axiom(or(not(or(X5,or(X4,or(p,q)))),or(not(or(p,or(not(q),r))),or(p,r))))), inference(etableau_closure_rule, [i_0_305267, ...])).
% 5.62/5.88 # End printing tableau
% 5.62/5.88 # SZS output end
% 5.62/5.88 # Branches closed with saturation will be marked with an "s"
% 5.62/5.88 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 5.62/5.88 # We now have 5 tableaux to operate on
% 5.62/5.88 # Found closed tableau during pool population.
% 5.62/5.88 # Proof search is over...
% 5.62/5.88 # Freeing feature tree
%------------------------------------------------------------------------------