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