TSTP Solution File: LCL230-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL230-3 : TPTP v8.1.0. Released v2.3.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 : n011.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:49 EDT 2022
% Result : Unsatisfiable 0.39s 0.63s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL230-3 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 00:43:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 8 Number of unprocessed: 8
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.39/0.61 # The folding up rule is enabled...
% 0.39/0.61 # Local unification is enabled...
% 0.39/0.61 # Any saturation attempts will use folding labels...
% 0.39/0.61 # 8 beginning clauses after preprocessing and clausification
% 0.39/0.61 # Creating start rules for all 1 conjectures.
% 0.39/0.61 # There are 1 start rule candidates:
% 0.39/0.61 # Found 6 unit axioms.
% 0.39/0.61 # 1 start rule tableaux created.
% 0.39/0.61 # 2 extension rule candidate clauses
% 0.39/0.61 # 6 unit axiom clauses
% 0.39/0.61
% 0.39/0.61 # Requested 8, 32 cores available to the main process.
% 0.39/0.61 # There are not enough tableaux to fork, creating more from the initial 1
% 0.39/0.63 # There were 1 total branch saturation attempts.
% 0.39/0.63 # There were 0 of these attempts blocked.
% 0.39/0.63 # There were 0 deferred branch saturation attempts.
% 0.39/0.63 # There were 0 free duplicated saturations.
% 0.39/0.63 # There were 1 total successful branch saturations.
% 0.39/0.63 # There were 0 successful branch saturations in interreduction.
% 0.39/0.63 # There were 0 successful branch saturations on the branch.
% 0.39/0.63 # There were 1 successful branch saturations after the branch.
% 0.39/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.63 # Begin clausification derivation
% 0.39/0.63
% 0.39/0.63 # End clausification derivation
% 0.39/0.63 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.39/0.63 cnf(i_0_11, plain, (axiom(or(not(X1),or(X2,X1))))).
% 0.39/0.63 cnf(i_0_10, plain, (axiom(or(not(or(X1,X1)),X1)))).
% 0.39/0.63 cnf(i_0_12, plain, (axiom(or(not(or(X1,X2)),or(X2,X1))))).
% 0.39/0.63 cnf(i_0_13, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))))).
% 0.39/0.63 cnf(i_0_14, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))))).
% 0.39/0.63 cnf(i_0_18, negated_conjecture, (~theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))))).
% 0.39/0.63 cnf(i_0_16, plain, (theorem(X1)|~axiom(X1))).
% 0.39/0.63 cnf(i_0_17, plain, (theorem(X1)|~theorem(or(not(X2),X1))|~theorem(X2))).
% 0.39/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.39/0.63 # Begin printing tableau
% 0.39/0.63 # Found 7 steps
% 0.39/0.63 cnf(i_0_18, negated_conjecture, (~theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))))), inference(start_rule)).
% 0.39/0.63 cnf(i_0_19, plain, (~theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))))), inference(extension_rule, [i_0_17])).
% 0.39/0.63 cnf(i_0_23, plain, (~theorem(or(not(or(not(X1),or(X3,X1))),or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))))), inference(extension_rule, [i_0_17])).
% 0.39/0.63 cnf(i_0_24, plain, (~theorem(or(not(X1),or(X3,X1)))), inference(extension_rule, [i_0_16])).
% 0.39/0.63 cnf(i_0_36, plain, (~axiom(or(not(X1),or(X3,X1)))), inference(closure_rule, [i_0_11])).
% 0.39/0.63 cnf(i_0_29, plain, (~theorem(or(not(X1),or(X3,X1)))), inference(closure_rule, [i_0_24])).
% 0.39/0.63 cnf(i_0_28, plain, (~theorem(or(not(or(not(X1),or(X3,X1))),or(not(or(not(X1),or(X3,X1))),or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))))))), inference(etableau_closure_rule, [i_0_28, ...])).
% 0.39/0.63 # End printing tableau
% 0.39/0.63 # SZS output end
% 0.39/0.63 # Branches closed with saturation will be marked with an "s"
% 0.39/0.63 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.39/0.63 # We now have 3 tableaux to operate on
% 0.39/0.63 # Found closed tableau during pool population.
% 0.39/0.63 # Proof search is over...
% 0.39/0.63 # Freeing feature tree
%------------------------------------------------------------------------------