TSTP Solution File: LCL075-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL075-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:39 EDT 2023
% Result : Unsatisfiable 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 13 unt; 0 nHn; 7 RR)
% Number of literals : 25 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 52 ( 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.mRc0sSiU1Y/E---3.1_27644.p',condensed_detachment) ).
cnf(cn_CAMerideth,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),implies(not(X3),not(X4))),X3),X5),implies(implies(X5,X1),implies(X4,X1)))),
file('/export/starexec/sandbox2/tmp/tmp.mRc0sSiU1Y/E---3.1_27644.p',cn_CAMerideth) ).
cnf(prove_cn_3,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox2/tmp/tmp.mRc0sSiU1Y/E---3.1_27644.p',prove_cn_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(implies(implies(X1,X2),implies(not(X3),not(X4))),X3),X5),implies(implies(X5,X1),implies(X4,X1)))),
cn_CAMerideth ).
cnf(c_0_5,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(implies(implies(implies(X2,X4),implies(not(X5),not(X3))),X5),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(not(X2),X3)),X4),implies(X2,X4))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X3),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X2)),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),not(X2)),X1),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(not(X3),not(X1)),X3),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
prove_cn_3 ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
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.00/0.09 % Problem : LCL075-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n009.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 12:22:14 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.mRc0sSiU1Y/E---3.1_27644.p
% 0.14/0.46 # Version: 3.1pre001
% 0.14/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 # Starting sh5l with 300s (1) cores
% 0.14/0.46 # new_bool_1 with pid 27723 completed with status 0
% 0.14/0.46 # Result found by new_bool_1
% 0.14/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.46 # Search class: FHUNF-FFSF21-DFFFFFNN
% 0.14/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 # Starting G----_0019_C18_F1_PI_SE_CS_SP_S0Y with 181s (1) cores
% 0.14/0.46 # G----_0019_C18_F1_PI_SE_CS_SP_S0Y with pid 27728 completed with status 0
% 0.14/0.46 # Result found by G----_0019_C18_F1_PI_SE_CS_SP_S0Y
% 0.14/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.46 # Search class: FHUNF-FFSF21-DFFFFFNN
% 0.14/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 # Starting G----_0019_C18_F1_PI_SE_CS_SP_S0Y with 181s (1) cores
% 0.14/0.46 # Preprocessing time : 0.001 s
% 0.14/0.46
% 0.14/0.46 # Proof found!
% 0.14/0.46 # SZS status Unsatisfiable
% 0.14/0.46 # SZS output start CNFRefutation
% See solution above
% 0.14/0.46 # Parsed axioms : 3
% 0.14/0.46 # Removed by relevancy pruning/SinE : 0
% 0.14/0.46 # Initial clauses : 3
% 0.14/0.46 # Removed in clause preprocessing : 0
% 0.14/0.46 # Initial clauses in saturation : 3
% 0.14/0.46 # Processed clauses : 1071
% 0.14/0.46 # ...of these trivial : 136
% 0.14/0.46 # ...subsumed : 642
% 0.14/0.46 # ...remaining for further processing : 293
% 0.14/0.46 # Other redundant clauses eliminated : 0
% 0.14/0.46 # Clauses deleted for lack of memory : 0
% 0.14/0.46 # Backward-subsumed : 8
% 0.14/0.46 # Backward-rewritten : 15
% 0.14/0.46 # Generated clauses : 7779
% 0.14/0.46 # ...of the previous two non-redundant : 5189
% 0.14/0.46 # ...aggressively subsumed : 0
% 0.14/0.46 # Contextual simplify-reflections : 0
% 0.14/0.46 # Paramodulations : 7779
% 0.14/0.46 # Factorizations : 0
% 0.14/0.46 # NegExts : 0
% 0.14/0.46 # Equation resolutions : 0
% 0.14/0.46 # Total rewrite steps : 2707
% 0.14/0.46 # Propositional unsat checks : 0
% 0.14/0.46 # Propositional check models : 0
% 0.14/0.46 # Propositional check unsatisfiable : 0
% 0.14/0.46 # Propositional clauses : 0
% 0.14/0.46 # Propositional clauses after purity: 0
% 0.14/0.46 # Propositional unsat core size : 0
% 0.14/0.46 # Propositional preprocessing time : 0.000
% 0.14/0.46 # Propositional encoding time : 0.000
% 0.14/0.46 # Propositional solver time : 0.000
% 0.14/0.46 # Success case prop preproc time : 0.000
% 0.14/0.46 # Success case prop encoding time : 0.000
% 0.14/0.46 # Success case prop solver time : 0.000
% 0.14/0.46 # Current number of processed clauses : 270
% 0.14/0.46 # Positive orientable unit clauses : 177
% 0.14/0.46 # Positive unorientable unit clauses: 0
% 0.14/0.46 # Negative unit clauses : 5
% 0.14/0.46 # Non-unit-clauses : 88
% 0.14/0.46 # Current number of unprocessed clauses: 2438
% 0.14/0.46 # ...number of literals in the above : 3521
% 0.14/0.46 # Current number of archived formulas : 0
% 0.14/0.46 # Current number of archived clauses : 23
% 0.14/0.46 # Clause-clause subsumption calls (NU) : 5629
% 0.14/0.46 # Rec. Clause-clause subsumption calls : 5629
% 0.14/0.46 # Non-unit clause-clause subsumptions : 647
% 0.14/0.46 # Unit Clause-clause subsumption calls : 62
% 0.14/0.46 # Rewrite failures with RHS unbound : 0
% 0.14/0.46 # BW rewrite match attempts : 13974
% 0.14/0.46 # BW rewrite match successes : 15
% 0.14/0.46 # Condensation attempts : 0
% 0.14/0.46 # Condensation successes : 0
% 0.14/0.46 # Termbank termtop insertions : 86777
% 0.14/0.46
% 0.14/0.46 # -------------------------------------------------
% 0.14/0.46 # User time : 0.058 s
% 0.14/0.46 # System time : 0.006 s
% 0.14/0.46 # Total time : 0.064 s
% 0.14/0.46 # Maximum resident set size: 1648 pages
% 0.14/0.46
% 0.14/0.46 # -------------------------------------------------
% 0.14/0.46 # User time : 0.058 s
% 0.14/0.46 # System time : 0.009 s
% 0.14/0.46 # Total time : 0.066 s
% 0.14/0.46 # Maximum resident set size: 1680 pages
% 0.14/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------