TSTP Solution File: SWC130-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC130-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 19:41:39 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 16 unt; 3 nHn; 19 RR)
% Number of literals : 27 ( 6 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.1f2LkJ7SpR/E---3.1_2831.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.1f2LkJ7SpR/E---3.1_2831.p',co1_5) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.1f2LkJ7SpR/E---3.1_2831.p',clause100) ).
cnf(co1_8,negated_conjecture,
~ cyclefreeP(sk2),
file('/export/starexec/sandbox/tmp/tmp.1f2LkJ7SpR/E---3.1_2831.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.1f2LkJ7SpR/E---3.1_2831.p',clause8) ).
cnf(co1_7,negated_conjecture,
~ neq(sk4,nil),
file('/export/starexec/sandbox/tmp/tmp.1f2LkJ7SpR/E---3.1_2831.p',co1_7) ).
cnf(clause7,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/tmp/tmp.1f2LkJ7SpR/E---3.1_2831.p',clause7) ).
cnf(c_0_7,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_8,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_9,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_10,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ cyclefreeP(sk2),
co1_8 ).
cnf(c_0_12,negated_conjecture,
( X1 = sk4
| neq(sk4,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
ssList(nil),
clause8 ).
cnf(c_0_14,negated_conjecture,
~ neq(sk4,nil),
co1_7 ).
cnf(c_0_15,negated_conjecture,
~ cyclefreeP(sk4),
inference(rw,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,axiom,
cyclefreeP(nil),
clause7 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC130-1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:05:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.1f2LkJ7SpR/E---3.1_2831.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 2982 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.21/0.52 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2985 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.21/0.52 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.004 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 193
% 0.21/0.52 # Removed by relevancy pruning/SinE : 150
% 0.21/0.52 # Initial clauses : 43
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 43
% 0.21/0.52 # Processed clauses : 79
% 0.21/0.52 # ...of these trivial : 2
% 0.21/0.52 # ...subsumed : 2
% 0.21/0.52 # ...remaining for further processing : 75
% 0.21/0.52 # Other redundant clauses eliminated : 6
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 5
% 0.21/0.52 # Generated clauses : 22
% 0.21/0.52 # ...of the previous two non-redundant : 19
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 17
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 6
% 0.21/0.52 # Total rewrite steps : 17
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 26
% 0.21/0.52 # Positive orientable unit clauses : 6
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 20
% 0.21/0.52 # Current number of unprocessed clauses: 20
% 0.21/0.52 # ...number of literals in the above : 97
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 44
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 337
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 70
% 0.21/0.52 # Non-unit clause-clause subsumptions : 2
% 0.21/0.52 # Unit Clause-clause subsumption calls : 10
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 1
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3127
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.009 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.011 s
% 0.21/0.52 # Maximum resident set size: 1976 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.013 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.017 s
% 0.21/0.52 # Maximum resident set size: 1848 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------