TSTP Solution File: LCL106-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL106-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 300s
% DateTime : Mon May 20 23:44:59 EDT 2024
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 18 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 32 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(q_1,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_1) ).
cnf(q_4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_4) ).
cnf(prove_q_2,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q_2) ).
cnf(c_0_4,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_5,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_4 ).
cnf(c_0_6,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))),
q_1 ).
cnf(c_0_7,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
q_4 ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
inference(fof_simplification,[status(thm)],[prove_q_2]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
c_0_13 ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL106-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 02:39:37 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.51 # Version: 3.1.0
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # new_bool_3 with pid 30674 completed with status 0
% 0.22/0.51 # Result found by new_bool_3
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FHUNS-FFSF22-MFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 0.22/0.51 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 30679 completed with status 0
% 0.22/0.51 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FHUNS-FFSF22-MFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Unsatisfiable
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 4
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 4
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 4
% 0.22/0.51 # Processed clauses : 12
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 12
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 1
% 0.22/0.51 # Generated clauses : 25
% 0.22/0.51 # ...of the previous two non-redundant : 17
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 25
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 2
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 11
% 0.22/0.51 # Positive orientable unit clauses : 3
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 0
% 0.22/0.51 # Non-unit-clauses : 8
% 0.22/0.51 # Current number of unprocessed clauses: 9
% 0.22/0.51 # ...number of literals in the above : 25
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 1
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 10
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 10
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 0
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 6
% 0.22/0.51 # BW rewrite match successes : 1
% 0.22/0.51 # Condensation attempts : 12
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 506
% 0.22/0.51 # Search garbage collected termcells : 8
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.005 s
% 0.22/0.51 # Maximum resident set size: 1628 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.005 s
% 0.22/0.51 # Total time : 0.008 s
% 0.22/0.51 # Maximum resident set size: 1692 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------