TSTP Solution File: LCL086-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL086-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:41 EDT 2023
% Result : Unsatisfiable 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 19 unt; 0 nHn; 5 RR)
% Number of literals : 45 ( 0 equ; 16 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 : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 95 ( 46 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.NUyZSgW3xK/E---3.1_29031.p',condensed_detachment) ).
cnf(ic_JLukasiewicz_4,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(X5,implies(implies(X4,X1),implies(X3,X1))))),
file('/export/starexec/sandbox2/tmp/tmp.NUyZSgW3xK/E---3.1_29031.p',ic_JLukasiewicz_4) ).
cnf(prove_ic_1,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox2/tmp/tmp.NUyZSgW3xK/E---3.1_29031.p',prove_ic_1) ).
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),implies(X3,X4)),implies(X5,implies(implies(X4,X1),implies(X3,X1))))),
ic_JLukasiewicz_4 ).
cnf(c_0_5,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(implies(X3,X5),implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X2,X3),implies(X4,X3)),implies(X3,X5)),implies(X6,implies(X3,X5))))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4))))
| ~ is_a_theorem(X6) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,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_7,c_0_4]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(implies(X4,X2),implies(X5,X2)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(X2,X3))))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_4]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_18]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_19]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X4),implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_20,c_0_4]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_21]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X2,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),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_23,c_0_4]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(implies(a,a)),
prove_ic_1 ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_4]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL086-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 11:55:34 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.NUyZSgW3xK/E---3.1_29031.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # new_bool_3 with pid 29110 completed with status 0
% 0.22/0.53 # Result found by new_bool_3
% 0.22/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.22/0.53 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 29114 completed with status 0
% 0.22/0.53 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.22/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Unsatisfiable
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 3
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 3
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 3
% 0.22/0.53 # Processed clauses : 51
% 0.22/0.53 # ...of these trivial : 1
% 0.22/0.53 # ...subsumed : 9
% 0.22/0.53 # ...remaining for further processing : 41
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 2
% 0.22/0.53 # Backward-rewritten : 14
% 0.22/0.53 # Generated clauses : 202
% 0.22/0.53 # ...of the previous two non-redundant : 161
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 202
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Total rewrite steps : 51
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 25
% 0.22/0.53 # Positive orientable unit clauses : 15
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 1
% 0.22/0.53 # Non-unit-clauses : 9
% 0.22/0.53 # Current number of unprocessed clauses: 61
% 0.22/0.53 # ...number of literals in the above : 80
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 16
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 73
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 73
% 0.22/0.53 # Non-unit clause-clause subsumptions : 11
% 0.22/0.53 # Unit Clause-clause subsumption calls : 27
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 209
% 0.22/0.53 # BW rewrite match successes : 14
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 2274
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.003 s
% 0.22/0.53 # System time : 0.004 s
% 0.22/0.53 # Total time : 0.006 s
% 0.22/0.53 # Maximum resident set size: 1636 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.003 s
% 0.22/0.53 # System time : 0.007 s
% 0.22/0.53 # Total time : 0.010 s
% 0.22/0.53 # Maximum resident set size: 1676 pages
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------