TSTP Solution File: SWC007-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC007-1 : TPTP v8.1.2. Released v2.4.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 19:38:50 EDT 2023
% Result : Unsatisfiable 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 10 unt; 0 nHn; 19 RR)
% Number of literals : 39 ( 18 equ; 25 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.RzmLMDVJ5g/E---3.1_17382.p',co1_7) ).
cnf(co1_5,negated_conjecture,
nil = sk3,
file('/export/starexec/sandbox2/tmp/tmp.RzmLMDVJ5g/E---3.1_17382.p',co1_5) ).
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.RzmLMDVJ5g/E---3.1_17382.p',co1_8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.RzmLMDVJ5g/E---3.1_17382.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.RzmLMDVJ5g/E---3.1_17382.p',clause8) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.RzmLMDVJ5g/E---3.1_17382.p',clause73) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.RzmLMDVJ5g/E---3.1_17382.p',co1_2) ).
cnf(c_0_7,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_8,negated_conjecture,
nil = sk3,
co1_5 ).
cnf(c_0_9,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1 ),
co1_8 ).
cnf(c_0_10,negated_conjecture,
sk1 = nil,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( app(app(X1,X2),X3) != sk2
| app(X1,X3) != nil
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_13,axiom,
ssList(nil),
clause8 ).
cnf(c_0_14,negated_conjecture,
( app(nil,X1) != nil
| app(X2,X1) != sk2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_16,negated_conjecture,
( app(X1,nil) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15])]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SWC007-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:53:53 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.RzmLMDVJ5g/E---3.1_17382.p
% 0.18/0.47 # Version: 3.1pre001
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_3 with pid 17461 completed with status 0
% 0.18/0.47 # Result found by new_bool_3
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FHHSF-FFMM22-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # SAT001_MinMin_p005000_rr_RG with pid 17464 completed with status 0
% 0.18/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FHHSF-FFMM22-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.003 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Unsatisfiable
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 193
% 0.18/0.47 # Removed by relevancy pruning/SinE : 168
% 0.18/0.47 # Initial clauses : 25
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 25
% 0.18/0.47 # Processed clauses : 47
% 0.18/0.47 # ...of these trivial : 3
% 0.18/0.47 # ...subsumed : 2
% 0.18/0.47 # ...remaining for further processing : 42
% 0.18/0.47 # Other redundant clauses eliminated : 5
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 0
% 0.18/0.47 # Generated clauses : 22
% 0.18/0.47 # ...of the previous two non-redundant : 13
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 18
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 5
% 0.18/0.47 # Total rewrite steps : 28
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 19
% 0.18/0.47 # Positive orientable unit clauses : 6
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 1
% 0.18/0.47 # Non-unit-clauses : 12
% 0.18/0.47 # Current number of unprocessed clauses: 11
% 0.18/0.47 # ...number of literals in the above : 46
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 22
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 75
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 33
% 0.18/0.47 # Non-unit clause-clause subsumptions : 0
% 0.18/0.47 # Unit Clause-clause subsumption calls : 2
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 0
% 0.18/0.47 # BW rewrite match successes : 0
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 2635
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.003 s
% 0.18/0.47 # System time : 0.005 s
% 0.18/0.47 # Total time : 0.007 s
% 0.18/0.47 # Maximum resident set size: 2012 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.006 s
% 0.18/0.47 # System time : 0.006 s
% 0.18/0.47 # Total time : 0.012 s
% 0.18/0.47 # Maximum resident set size: 1848 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------