TSTP Solution File: LCL083-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL083-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:23:40 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of clauses : 33 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 46 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 110 ( 58 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rMPxBYT4tD/E---3.1_19457.p',condensed_detachment) ).
cnf(ic_JLukasiewicz,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
file('/export/starexec/sandbox/tmp/tmp.rMPxBYT4tD/E---3.1_19457.p',ic_JLukasiewicz) ).
cnf(prove_ic_3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('/export/starexec/sandbox/tmp/tmp.rMPxBYT4tD/E---3.1_19457.p',prove_ic_3) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
ic_JLukasiewicz ).
cnf(c_0_5,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(implies(X2,X4),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),implies(X5,X2))),implies(X6,implies(implies(X4,X2),implies(X5,X2))))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(implies(X5,implies(X3,X6)),implies(implies(X2,X3),implies(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X2,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X3)),implies(X4,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_15]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,X2)),implies(X5,implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(X4,implies(X3,X5)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_17]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X2,X3),X4),X3),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_4]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_19]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X1),implies(X3,X1)),X4),implies(X5,X4))),
inference(spm,[status(thm)],[c_0_5,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(implies(X3,X4),X3),implies(X5,X3)),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_22]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X1,X2),X3)),implies(X4,implies(implies(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X3),X3)))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_26]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))),
inference(spm,[status(thm)],[c_0_27,c_0_4]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
prove_ic_3 ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_29,c_0_4]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL083-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n021.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 12:31:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.rMPxBYT4tD/E---3.1_19457.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19534 completed with status 0
% 0.21/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.52 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.21/0.52 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 19543 completed with status 0
% 0.21/0.52 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.52 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 3
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 3
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 3
% 0.21/0.52 # Processed clauses : 218
% 0.21/0.52 # ...of these trivial : 20
% 0.21/0.52 # ...subsumed : 80
% 0.21/0.52 # ...remaining for further processing : 118
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 1
% 0.21/0.52 # Backward-rewritten : 25
% 0.21/0.52 # Generated clauses : 1641
% 0.21/0.52 # ...of the previous two non-redundant : 826
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 1641
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 844
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 89
% 0.21/0.52 # Positive orientable unit clauses : 62
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 26
% 0.21/0.52 # Current number of unprocessed clauses: 224
% 0.21/0.52 # ...number of literals in the above : 315
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 29
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 479
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 479
% 0.21/0.52 # Non-unit clause-clause subsumptions : 81
% 0.21/0.52 # Unit Clause-clause subsumption calls : 62
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 2231
% 0.21/0.52 # BW rewrite match successes : 25
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 17183
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.015 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.019 s
% 0.21/0.52 # Maximum resident set size: 1580 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.084 s
% 0.21/0.52 # System time : 0.010 s
% 0.21/0.52 # Total time : 0.093 s
% 0.21/0.52 # Maximum resident set size: 1676 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------