TSTP Solution File: LCL035-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:11:19 EDT 2023
% Result : Unsatisfiable 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 7 RR)
% Number of literals : 28 ( 0 equ; 11 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 32 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.K5mVXaSm7V/E---3.1_30786.p',condensed_detachment) ).
cnf(c0_CAMerideth,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
file('/export/starexec/sandbox2/tmp/tmp.K5mVXaSm7V/E---3.1_30786.p',c0_CAMerideth) ).
cnf(prove_c0_4,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
file('/export/starexec/sandbox2/tmp/tmp.K5mVXaSm7V/E---3.1_30786.p',prove_c0_4) ).
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(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
c0_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(X3,falsehood)),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(falsehood,X2)),X3),implies(X4,X3))),
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(implies(X3,implies(falsehood,X4)),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(falsehood,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(X2,implies(falsehood,X3)))),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(falsehood,X1))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,implies(falsehood,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(falsehood,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(X1,implies(falsehood,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(falsehood,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
prove_c0_4 ).
cnf(c_0_17,plain,
is_a_theorem(implies(falsehood,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 11:47:08 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.K5mVXaSm7V/E---3.1_30786.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # sh5l with pid 30867 completed with status 0
% 0.23/0.54 # Result found by sh5l
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 0.23/0.54 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 30871 completed with status 0
% 0.23/0.54 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Unsatisfiable
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 3
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 3
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 3
% 0.23/0.54 # Processed clauses : 23
% 0.23/0.54 # ...of these trivial : 4
% 0.23/0.54 # ...subsumed : 0
% 0.23/0.54 # ...remaining for further processing : 19
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 2
% 0.23/0.54 # Backward-rewritten : 5
% 0.23/0.54 # Generated clauses : 49
% 0.23/0.54 # ...of the previous two non-redundant : 40
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 49
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Total rewrite steps : 17
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 12
% 0.23/0.54 # Positive orientable unit clauses : 7
% 0.23/0.54 # Positive unorientable unit clauses: 0
% 0.23/0.54 # Negative unit clauses : 1
% 0.23/0.54 # Non-unit-clauses : 4
% 0.23/0.54 # Current number of unprocessed clauses: 11
% 0.23/0.54 # ...number of literals in the above : 12
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 7
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 5
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 5
% 0.23/0.54 # Non-unit clause-clause subsumptions : 1
% 0.23/0.54 # Unit Clause-clause subsumption calls : 3
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 33
% 0.23/0.54 # BW rewrite match successes : 5
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 659
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.003 s
% 0.23/0.54 # System time : 0.000 s
% 0.23/0.54 # Total time : 0.004 s
% 0.23/0.54 # Maximum resident set size: 1624 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.003 s
% 0.23/0.54 # System time : 0.003 s
% 0.23/0.54 # Total time : 0.007 s
% 0.23/0.54 # Maximum resident set size: 1676 pages
% 0.23/0.54 % E---3.1 exiting
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------