TSTP Solution File: LCL380-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL380-1 : TPTP v8.1.2. Released v2.3.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:24:43 EDT 2023
% Result : Unsatisfiable 2.79s 0.78s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 40 ( 20 unt; 0 nHn; 15 RR)
% Number of literals : 67 ( 0 equ; 30 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 16 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.FNBJMtupT9/E---3.1_5986.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.FNBJMtupT9/E---3.1_5986.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.FNBJMtupT9/E---3.1_5986.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.FNBJMtupT9/E---3.1_5986.p',cn_3) ).
cnf(prove_cn_41,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(not(not(x)),y))),
file('/export/starexec/sandbox2/tmp/tmp.FNBJMtupT9/E---3.1_5986.p',prove_cn_41) ).
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,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_13,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_14,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_15,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X2,implies(X5,X4)))
| ~ is_a_theorem(implies(X1,implies(X3,X5))) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(implies(not(not(X1)),not(X1)),X2))),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X1,implies(X3,not(X2)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(implies(not(X1),X2),X3),X3))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X1,implies(X3,implies(not(not(X2)),not(X2))))) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X4))
| ~ is_a_theorem(implies(X4,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(implies(not(X3),X4),X2)))
| ~ is_a_theorem(implies(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(implies(not(X2),X2)),implies(not(X2),X2)))) ),
inference(spm,[status(thm)],[c_0_8,c_0_21]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(X1),implies(X1,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(implies(not(X3),X4),X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(not(not(implies(not(X1),X1))),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,not(implies(not(not(X1)),not(X1))))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(not(not(x)),y))),
prove_cn_41 ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_32]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(not(not(not(X1))),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ is_a_theorem(implies(not(not(x)),x)),
inference(spm,[status(thm)],[c_0_34,c_0_7]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL380-1 : TPTP v8.1.2. Released v2.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 12:35:34 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.FNBJMtupT9/E---3.1_5986.p
% 2.79/0.78 # Version: 3.1pre001
% 2.79/0.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.79/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.79/0.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.79/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.79/0.78 # Starting new_bool_1 with 300s (1) cores
% 2.79/0.78 # Starting sh5l with 300s (1) cores
% 2.79/0.78 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6064 completed with status 0
% 2.79/0.78 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.79/0.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.79/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.79/0.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.79/0.78 # No SInE strategy applied
% 2.79/0.78 # Search class: FHUNS-FFSF21-MFFFFFNN
% 2.79/0.78 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.79/0.78 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 2.79/0.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.79/0.78 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 2.79/0.78 # Starting new_bool_3 with 136s (1) cores
% 2.79/0.78 # Starting new_bool_1 with 136s (1) cores
% 2.79/0.78 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6071 completed with status 0
% 2.79/0.78 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.79/0.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.79/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.79/0.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.79/0.78 # No SInE strategy applied
% 2.79/0.78 # Search class: FHUNS-FFSF21-MFFFFFNN
% 2.79/0.78 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.79/0.78 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 2.79/0.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.79/0.78 # Preprocessing time : 0.002 s
% 2.79/0.78
% 2.79/0.78 # Proof found!
% 2.79/0.78 # SZS status Unsatisfiable
% 2.79/0.78 # SZS output start CNFRefutation
% See solution above
% 2.79/0.78 # Parsed axioms : 5
% 2.79/0.78 # Removed by relevancy pruning/SinE : 0
% 2.79/0.78 # Initial clauses : 5
% 2.79/0.78 # Removed in clause preprocessing : 0
% 2.79/0.78 # Initial clauses in saturation : 5
% 2.79/0.78 # Processed clauses : 1803
% 2.79/0.78 # ...of these trivial : 10
% 2.79/0.78 # ...subsumed : 1380
% 2.79/0.78 # ...remaining for further processing : 413
% 2.79/0.78 # Other redundant clauses eliminated : 0
% 2.79/0.78 # Clauses deleted for lack of memory : 0
% 2.79/0.78 # Backward-subsumed : 9
% 2.79/0.78 # Backward-rewritten : 2
% 2.79/0.78 # Generated clauses : 16982
% 2.79/0.78 # ...of the previous two non-redundant : 16650
% 2.79/0.78 # ...aggressively subsumed : 0
% 2.79/0.78 # Contextual simplify-reflections : 0
% 2.79/0.78 # Paramodulations : 16982
% 2.79/0.78 # Factorizations : 0
% 2.79/0.78 # NegExts : 0
% 2.79/0.78 # Equation resolutions : 0
% 2.79/0.78 # Total rewrite steps : 131
% 2.79/0.78 # Propositional unsat checks : 0
% 2.79/0.78 # Propositional check models : 0
% 2.79/0.78 # Propositional check unsatisfiable : 0
% 2.79/0.78 # Propositional clauses : 0
% 2.79/0.78 # Propositional clauses after purity: 0
% 2.79/0.78 # Propositional unsat core size : 0
% 2.79/0.78 # Propositional preprocessing time : 0.000
% 2.79/0.78 # Propositional encoding time : 0.000
% 2.79/0.78 # Propositional solver time : 0.000
% 2.79/0.78 # Success case prop preproc time : 0.000
% 2.79/0.78 # Success case prop encoding time : 0.000
% 2.79/0.78 # Success case prop solver time : 0.000
% 2.79/0.78 # Current number of processed clauses : 402
% 2.79/0.78 # Positive orientable unit clauses : 28
% 2.79/0.78 # Positive unorientable unit clauses: 0
% 2.79/0.78 # Negative unit clauses : 8
% 2.79/0.78 # Non-unit-clauses : 366
% 2.79/0.78 # Current number of unprocessed clauses: 14800
% 2.79/0.78 # ...number of literals in the above : 45462
% 2.79/0.78 # Current number of archived formulas : 0
% 2.79/0.78 # Current number of archived clauses : 11
% 2.79/0.78 # Clause-clause subsumption calls (NU) : 24093
% 2.79/0.78 # Rec. Clause-clause subsumption calls : 23270
% 2.79/0.78 # Non-unit clause-clause subsumptions : 1378
% 2.79/0.78 # Unit Clause-clause subsumption calls : 500
% 2.79/0.78 # Rewrite failures with RHS unbound : 0
% 2.79/0.78 # BW rewrite match attempts : 1367
% 2.79/0.78 # BW rewrite match successes : 2
% 2.79/0.78 # Condensation attempts : 0
% 2.79/0.78 # Condensation successes : 0
% 2.79/0.78 # Termbank termtop insertions : 282660
% 2.79/0.78
% 2.79/0.78 # -------------------------------------------------
% 2.79/0.78 # User time : 0.314 s
% 2.79/0.78 # System time : 0.013 s
% 2.79/0.78 # Total time : 0.328 s
% 2.79/0.78 # Maximum resident set size: 1596 pages
% 2.79/0.78
% 2.79/0.78 # -------------------------------------------------
% 2.79/0.78 # User time : 1.591 s
% 2.79/0.78 # System time : 0.037 s
% 2.79/0.78 # Total time : 1.628 s
% 2.79/0.78 # Maximum resident set size: 1676 pages
% 2.79/0.78 % E---3.1 exiting
%------------------------------------------------------------------------------