TSTP Solution File: LCL041-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL041-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:32 EDT 2023
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 12 unt; 0 nHn; 7 RR)
% Number of literals : 22 ( 0 equ; 8 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 : 29 ( 3 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.SSTM4RgDgl/E---3.1_3577.p',condensed_detachment) ).
cnf(cn_21,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.SSTM4RgDgl/E---3.1_3577.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.SSTM4RgDgl/E---3.1_3577.p',cn_54) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.SSTM4RgDgl/E---3.1_3577.p',cn_3) ).
cnf(prove_cn_30,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
file('/export/starexec/sandbox2/tmp/tmp.SSTM4RgDgl/E---3.1_3577.p',prove_cn_30) ).
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,implies(X2,X3)),implies(X2,implies(X1,X3)))),
cn_21 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
cn_54 ).
cnf(c_0_9,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
prove_cn_30 ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL041-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 12:14:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.49 Running first-order model finding
% 0.19/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.SSTM4RgDgl/E---3.1_3577.p
% 0.19/0.52 # Version: 3.1pre001
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3655 completed with status 0
% 0.19/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # No SInE strategy applied
% 0.19/0.52 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.19/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.52 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.19/0.52 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 3659 completed with status 0
% 0.19/0.52 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 0.19/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.52 # No SInE strategy applied
% 0.19/0.52 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.19/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Unsatisfiable
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 7
% 0.19/0.52 # Removed by relevancy pruning/SinE : 0
% 0.19/0.52 # Initial clauses : 7
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 7
% 0.19/0.52 # Processed clauses : 285
% 0.19/0.52 # ...of these trivial : 2
% 0.19/0.52 # ...subsumed : 151
% 0.19/0.52 # ...remaining for further processing : 132
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 3
% 0.19/0.52 # Backward-rewritten : 2
% 0.19/0.52 # Generated clauses : 897
% 0.19/0.52 # ...of the previous two non-redundant : 653
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 0
% 0.19/0.52 # Paramodulations : 897
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Total rewrite steps : 219
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 120
% 0.19/0.52 # Positive orientable unit clauses : 64
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 3
% 0.19/0.52 # Non-unit-clauses : 53
% 0.19/0.52 # Current number of unprocessed clauses: 348
% 0.19/0.52 # ...number of literals in the above : 533
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 12
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 1501
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 1105
% 0.19/0.52 # Non-unit clause-clause subsumptions : 151
% 0.19/0.52 # Unit Clause-clause subsumption calls : 62
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 1373
% 0.19/0.52 # BW rewrite match successes : 3
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 10271
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.017 s
% 0.19/0.52 # System time : 0.003 s
% 0.19/0.52 # Total time : 0.019 s
% 0.19/0.52 # Maximum resident set size: 1596 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.082 s
% 0.19/0.52 # System time : 0.010 s
% 0.19/0.52 # Total time : 0.092 s
% 0.19/0.52 # Maximum resident set size: 1680 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------