TSTP Solution File: LCL186-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL186-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 : n012.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:16 EDT 2022
% Result : Unsatisfiable 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL186-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.13/0.34 % Computer : n012.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 13:52:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.13/0.36 # and selection function SelectCQArEqLast.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 9 Number of unprocessed: 9
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 9 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 1 conjectures.
% 0.13/0.36 # There are 1 start rule candidates:
% 0.13/0.36 # Found 6 unit axioms.
% 0.13/0.36 # 1 start rule tableaux created.
% 0.13/0.36 # 3 extension rule candidate clauses
% 0.13/0.36 # 6 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.36 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.13/0.36 # There were 0 total branch saturation attempts.
% 0.13/0.36 # There were 0 of these attempts blocked.
% 0.13/0.36 # There were 0 deferred branch saturation attempts.
% 0.13/0.36 # There were 0 free duplicated saturations.
% 0.13/0.36 # There were 0 total successful branch saturations.
% 0.13/0.36 # There were 0 successful branch saturations in interreduction.
% 0.13/0.36 # There were 0 successful branch saturations on the branch.
% 0.13/0.36 # There were 0 successful branch saturations after the branch.
% 0.13/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.36 # Begin clausification derivation
% 0.13/0.36
% 0.13/0.36 # End clausification derivation
% 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.36 cnf(i_0_11, plain, (axiom(or(not(X1),or(X2,X1))))).
% 0.13/0.36 cnf(i_0_10, plain, (axiom(or(not(or(X1,X1)),X1)))).
% 0.13/0.36 cnf(i_0_12, plain, (axiom(or(not(or(X1,X2)),or(X2,X1))))).
% 0.13/0.36 cnf(i_0_13, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))))).
% 0.13/0.36 cnf(i_0_14, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))))).
% 0.13/0.36 cnf(i_0_18, negated_conjecture, (~theorem(or(not(not(p)),or(not(p),q))))).
% 0.13/0.36 cnf(i_0_15, plain, (theorem(X1)|~axiom(X1))).
% 0.13/0.36 cnf(i_0_16, plain, (theorem(X1)|~theorem(X2)|~axiom(or(not(X2),X1)))).
% 0.13/0.36 cnf(i_0_17, plain, (theorem(or(not(X1),X2))|~theorem(or(not(X3),X2))|~axiom(or(not(X1),X3)))).
% 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.36 # Begin printing tableau
% 0.13/0.36 # Found 5 steps
% 0.13/0.36 cnf(i_0_18, negated_conjecture, (~theorem(or(not(not(p)),or(not(p),q)))), inference(start_rule)).
% 0.13/0.36 cnf(i_0_19, plain, (~theorem(or(not(not(p)),or(not(p),q)))), inference(extension_rule, [i_0_17])).
% 0.13/0.36 cnf(i_0_27, plain, (~axiom(or(not(not(p)),or(q,not(p))))), inference(closure_rule, [i_0_11])).
% 0.13/0.36 cnf(i_0_26, plain, (~theorem(or(not(or(q,not(p))),or(not(p),q)))), inference(extension_rule, [i_0_15])).
% 0.13/0.36 cnf(i_0_29, plain, (~axiom(or(not(or(q,not(p))),or(not(p),q)))), inference(closure_rule, [i_0_12])).
% 0.13/0.36 # End printing tableau
% 0.13/0.36 # SZS output end
% 0.13/0.36 # Branches closed with saturation will be marked with an "s"
% 0.13/0.36 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36 # We now have 3 tableaux to operate on
% 0.13/0.36 # Found closed tableau during pool population.
% 0.13/0.36 # Proof search is over...
% 0.13/0.36 # Freeing feature tree
%------------------------------------------------------------------------------