TSTP Solution File: LCL397-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL397-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:12:37 EDT 2023
% Result : Unsatisfiable 0.10s 0.35s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 9 RR)
% Number of literals : 34 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Ao8PiYooUn/E---3.1_29989.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.Ao8PiYooUn/E---3.1_29989.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.Ao8PiYooUn/E---3.1_29989.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.Ao8PiYooUn/E---3.1_29989.p',cn_3) ).
cnf(prove_cn_63,negated_conjecture,
~ is_a_theorem(implies(x,implies(y,y))),
file('/export/starexec/sandbox2/tmp/tmp.Ao8PiYooUn/E---3.1_29989.p',prove_cn_63) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ is_a_theorem(implies(x,implies(y,y))),
prove_cn_63 ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : LCL397-1 : TPTP v8.1.2. Released v2.3.0.
% 0.04/0.08 % Command : run_E %s %d THM
% 0.06/0.26 % Computer : n019.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 2400
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Mon Oct 2 12:41:36 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.10/0.34 Running first-order theorem proving
% 0.10/0.34 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Ao8PiYooUn/E---3.1_29989.p
% 0.10/0.35 # Version: 3.1pre001
% 0.10/0.35 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.35 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.35 # Starting sh5l with 300s (1) cores
% 0.10/0.35 # sh5l with pid 30070 completed with status 0
% 0.10/0.35 # Result found by sh5l
% 0.10/0.35 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.35 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.35 # Starting sh5l with 300s (1) cores
% 0.10/0.35 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.35 # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.10/0.35 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.35 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 0.10/0.35 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 30076 completed with status 0
% 0.10/0.35 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.10/0.35 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.35 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.35 # Starting sh5l with 300s (1) cores
% 0.10/0.35 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.35 # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.10/0.35 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.35 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 163s (1) cores
% 0.10/0.35 # Preprocessing time : 0.001 s
% 0.10/0.35 # Presaturation interreduction done
% 0.10/0.35
% 0.10/0.35 # Proof found!
% 0.10/0.35 # SZS status Unsatisfiable
% 0.10/0.35 # SZS output start CNFRefutation
% See solution above
% 0.10/0.35 # Parsed axioms : 5
% 0.10/0.35 # Removed by relevancy pruning/SinE : 0
% 0.10/0.35 # Initial clauses : 5
% 0.10/0.35 # Removed in clause preprocessing : 0
% 0.10/0.35 # Initial clauses in saturation : 5
% 0.10/0.35 # Processed clauses : 61
% 0.10/0.35 # ...of these trivial : 0
% 0.10/0.35 # ...subsumed : 22
% 0.10/0.35 # ...remaining for further processing : 39
% 0.10/0.35 # Other redundant clauses eliminated : 0
% 0.10/0.35 # Clauses deleted for lack of memory : 0
% 0.10/0.35 # Backward-subsumed : 0
% 0.10/0.35 # Backward-rewritten : 0
% 0.10/0.35 # Generated clauses : 143
% 0.10/0.35 # ...of the previous two non-redundant : 117
% 0.10/0.35 # ...aggressively subsumed : 0
% 0.10/0.35 # Contextual simplify-reflections : 0
% 0.10/0.35 # Paramodulations : 143
% 0.10/0.35 # Factorizations : 0
% 0.10/0.35 # NegExts : 0
% 0.10/0.35 # Equation resolutions : 0
% 0.10/0.35 # Total rewrite steps : 3
% 0.10/0.35 # Propositional unsat checks : 0
% 0.10/0.35 # Propositional check models : 0
% 0.10/0.35 # Propositional check unsatisfiable : 0
% 0.10/0.35 # Propositional clauses : 0
% 0.10/0.35 # Propositional clauses after purity: 0
% 0.10/0.35 # Propositional unsat core size : 0
% 0.10/0.35 # Propositional preprocessing time : 0.000
% 0.10/0.35 # Propositional encoding time : 0.000
% 0.10/0.35 # Propositional solver time : 0.000
% 0.10/0.35 # Success case prop preproc time : 0.000
% 0.10/0.35 # Success case prop encoding time : 0.000
% 0.10/0.35 # Success case prop solver time : 0.000
% 0.10/0.35 # Current number of processed clauses : 34
% 0.10/0.35 # Positive orientable unit clauses : 5
% 0.10/0.35 # Positive unorientable unit clauses: 0
% 0.10/0.35 # Negative unit clauses : 2
% 0.10/0.35 # Non-unit-clauses : 27
% 0.10/0.35 # Current number of unprocessed clauses: 65
% 0.10/0.35 # ...number of literals in the above : 174
% 0.10/0.35 # Current number of archived formulas : 0
% 0.10/0.35 # Current number of archived clauses : 5
% 0.10/0.35 # Clause-clause subsumption calls (NU) : 249
% 0.10/0.35 # Rec. Clause-clause subsumption calls : 238
% 0.10/0.35 # Non-unit clause-clause subsumptions : 22
% 0.10/0.35 # Unit Clause-clause subsumption calls : 11
% 0.10/0.35 # Rewrite failures with RHS unbound : 0
% 0.10/0.35 # BW rewrite match attempts : 25
% 0.10/0.35 # BW rewrite match successes : 0
% 0.10/0.35 # Condensation attempts : 0
% 0.10/0.35 # Condensation successes : 0
% 0.10/0.35 # Termbank termtop insertions : 2056
% 0.10/0.35
% 0.10/0.35 # -------------------------------------------------
% 0.10/0.35 # User time : 0.004 s
% 0.10/0.35 # System time : 0.000 s
% 0.10/0.35 # Total time : 0.004 s
% 0.10/0.35 # Maximum resident set size: 1640 pages
% 0.10/0.35
% 0.10/0.35 # -------------------------------------------------
% 0.10/0.35 # User time : 0.005 s
% 0.10/0.35 # System time : 0.001 s
% 0.10/0.35 # Total time : 0.006 s
% 0.10/0.35 # Maximum resident set size: 1676 pages
% 0.10/0.35 % E---3.1 exiting
% 0.10/0.35 % E---3.1 exiting
%------------------------------------------------------------------------------