TSTP Solution File: LCL045-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL045-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:26:13 EDT 2024
% Result : Unsatisfiable 26.78s 3.87s
% Output : CNFRefutation 26.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 15 unt; 0 nHn; 12 RR)
% Number of literals : 39 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 50 ( 4 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.7TGrX6HOmF/E---3.1_14411.p',condensed_detachment) ).
cnf(cn_22,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.7TGrX6HOmF/E---3.1_14411.p',cn_22) ).
cnf(cn_21,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.7TGrX6HOmF/E---3.1_14411.p',cn_21) ).
cnf(cn_54,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
file('/export/starexec/sandbox2/tmp/tmp.7TGrX6HOmF/E---3.1_14411.p',cn_54) ).
cnf(prove_cn_46,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
file('/export/starexec/sandbox2/tmp/tmp.7TGrX6HOmF/E---3.1_14411.p',prove_cn_46) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.7TGrX6HOmF/E---3.1_14411.p',cn_18) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.7TGrX6HOmF/E---3.1_14411.p',cn_3) ).
cnf(c_0_7,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_8,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_7 ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
cn_22 ).
cnf(c_0_10,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
cn_21 ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
cn_54 ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
inference(fof_simplification,[status(thm)],[prove_cn_46]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(X1,X4),X3))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
c_0_16 ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(not(X1),X3))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_22,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL045-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:25:36 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.7TGrX6HOmF/E---3.1_14411.p
% 26.78/3.87 # Version: 3.1.0
% 26.78/3.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 26.78/3.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.78/3.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.78/3.87 # Starting new_bool_3 with 300s (1) cores
% 26.78/3.87 # Starting new_bool_1 with 300s (1) cores
% 26.78/3.87 # Starting sh5l with 300s (1) cores
% 26.78/3.87 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14559 completed with status 0
% 26.78/3.87 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 26.78/3.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 26.78/3.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.78/3.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.78/3.87 # No SInE strategy applied
% 26.78/3.87 # Search class: FHUNM-FFSF21-MFFFFFNN
% 26.78/3.87 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 26.78/3.87 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 26.78/3.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.78/3.87 # Starting new_bool_3 with 136s (1) cores
% 26.78/3.87 # Starting new_bool_1 with 136s (1) cores
% 26.78/3.87 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 26.78/3.87 # C12_02_nc_SAT001_MinMin_p005000_rr with pid 14570 completed with status 0
% 26.78/3.87 # Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 26.78/3.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 26.78/3.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.78/3.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.78/3.87 # No SInE strategy applied
% 26.78/3.87 # Search class: FHUNM-FFSF21-MFFFFFNN
% 26.78/3.87 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 26.78/3.87 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 26.78/3.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.78/3.87 # Starting new_bool_3 with 136s (1) cores
% 26.78/3.87 # Starting new_bool_1 with 136s (1) cores
% 26.78/3.87 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 26.78/3.87 # Preprocessing time : 0.002 s
% 26.78/3.87 # Presaturation interreduction done
% 26.78/3.87
% 26.78/3.87 # Proof found!
% 26.78/3.87 # SZS status Unsatisfiable
% 26.78/3.87 # SZS output start CNFRefutation
% See solution above
% 26.78/3.87 # Parsed axioms : 7
% 26.78/3.87 # Removed by relevancy pruning/SinE : 0
% 26.78/3.87 # Initial clauses : 7
% 26.78/3.87 # Removed in clause preprocessing : 0
% 26.78/3.87 # Initial clauses in saturation : 7
% 26.78/3.87 # Processed clauses : 18717
% 26.78/3.87 # ...of these trivial : 158
% 26.78/3.87 # ...subsumed : 16809
% 26.78/3.87 # ...remaining for further processing : 1750
% 26.78/3.87 # Other redundant clauses eliminated : 0
% 26.78/3.87 # Clauses deleted for lack of memory : 0
% 26.78/3.87 # Backward-subsumed : 15
% 26.78/3.87 # Backward-rewritten : 7
% 26.78/3.87 # Generated clauses : 223823
% 26.78/3.87 # ...of the previous two non-redundant : 205382
% 26.78/3.87 # ...aggressively subsumed : 0
% 26.78/3.87 # Contextual simplify-reflections : 0
% 26.78/3.87 # Paramodulations : 223823
% 26.78/3.87 # Factorizations : 0
% 26.78/3.87 # NegExts : 0
% 26.78/3.87 # Equation resolutions : 0
% 26.78/3.87 # Disequality decompositions : 0
% 26.78/3.87 # Total rewrite steps : 18300
% 26.78/3.87 # ...of those cached : 16086
% 26.78/3.87 # Propositional unsat checks : 0
% 26.78/3.87 # Propositional check models : 0
% 26.78/3.87 # Propositional check unsatisfiable : 0
% 26.78/3.87 # Propositional clauses : 0
% 26.78/3.87 # Propositional clauses after purity: 0
% 26.78/3.87 # Propositional unsat core size : 0
% 26.78/3.87 # Propositional preprocessing time : 0.000
% 26.78/3.87 # Propositional encoding time : 0.000
% 26.78/3.87 # Propositional solver time : 0.000
% 26.78/3.87 # Success case prop preproc time : 0.000
% 26.78/3.87 # Success case prop encoding time : 0.000
% 26.78/3.87 # Success case prop solver time : 0.000
% 26.78/3.87 # Current number of processed clauses : 1721
% 26.78/3.87 # Positive orientable unit clauses : 456
% 26.78/3.87 # Positive unorientable unit clauses: 0
% 26.78/3.87 # Negative unit clauses : 14
% 26.78/3.87 # Non-unit-clauses : 1251
% 26.78/3.87 # Current number of unprocessed clauses: 185988
% 26.78/3.87 # ...number of literals in the above : 416687
% 26.78/3.87 # Current number of archived formulas : 0
% 26.78/3.87 # Current number of archived clauses : 29
% 26.78/3.87 # Clause-clause subsumption calls (NU) : 325132
% 26.78/3.87 # Rec. Clause-clause subsumption calls : 316005
% 26.78/3.87 # Non-unit clause-clause subsumptions : 16801
% 26.78/3.87 # Unit Clause-clause subsumption calls : 9859
% 26.78/3.87 # Rewrite failures with RHS unbound : 0
% 26.78/3.87 # BW rewrite match attempts : 81501
% 26.78/3.87 # BW rewrite match successes : 7
% 26.78/3.87 # Condensation attempts : 0
% 26.78/3.87 # Condensation successes : 0
% 26.78/3.87 # Termbank termtop insertions : 3113276
% 26.78/3.87 # Search garbage collected termcells : 8
% 26.78/3.87
% 26.78/3.87 # -------------------------------------------------
% 26.78/3.87 # User time : 3.187 s
% 26.78/3.87 # System time : 0.119 s
% 26.78/3.87 # Total time : 3.306 s
% 26.78/3.87 # Maximum resident set size: 1604 pages
% 26.78/3.87
% 26.78/3.87 # -------------------------------------------------
% 26.78/3.87 # User time : 16.059 s
% 26.78/3.87 # System time : 0.379 s
% 26.78/3.87 # Total time : 16.438 s
% 26.78/3.87 # Maximum resident set size: 1696 pages
% 26.78/3.87 % E---3.1 exiting
%------------------------------------------------------------------------------