TSTP Solution File: SWC092+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC092+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:26 EDT 2023
% Result : Theorem 0.61s 0.56s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 18 unt; 0 def)
% Number of atoms : 182 ( 39 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 220 ( 84 ~; 77 |; 38 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn; 35 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ( app(X3,X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X6
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) = X3
& lt(X9,X7) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ciKFzM3jdI/E---3.1_22034.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ciKFzM3jdI/E---3.1_22034.p',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.ciKFzM3jdI/E---3.1_22034.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ciKFzM3jdI/E---3.1_22034.p',ax26) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ciKFzM3jdI/E---3.1_22034.p',ax55) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.ciKFzM3jdI/E---3.1_22034.p',ax17) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ciKFzM3jdI/E---3.1_22034.p',ax15) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.ciKFzM3jdI/E---3.1_22034.p',ax57) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ( app(X3,X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X6
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) = X3
& lt(X9,X7) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,plain,
! [X79,X80,X83,X84] :
( ( ssList(esk20_2(X79,X80))
| ~ segmentP(X79,X80)
| ~ ssList(X80)
| ~ ssList(X79) )
& ( ssList(esk21_2(X79,X80))
| ~ segmentP(X79,X80)
| ~ ssList(X80)
| ~ ssList(X79) )
& ( app(app(esk20_2(X79,X80),X80),esk21_2(X79,X80)) = X79
| ~ segmentP(X79,X80)
| ~ ssList(X80)
| ~ ssList(X79) )
& ( ~ ssList(X83)
| ~ ssList(X84)
| app(app(X83,X80),X84) != X79
| segmentP(X79,X80)
| ~ ssList(X80)
| ~ ssList(X79) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X15,X17,X18,X19,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( ~ ssList(X15)
| ~ neq(X15,nil)
| ~ segmentP(esk2_0,X15)
| ~ segmentP(esk1_0,X15) )
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X17)
| ~ ssList(X18)
| app(cons(X17,nil),X18) != esk5_0
| ~ ssItem(X19)
| ~ ssList(X20)
| app(X20,cons(X19,nil)) != esk3_0
| ~ lt(X19,X17) )
& ( nil = esk4_0
| nil != esk3_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_11,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X26] :
( ~ ssList(X26)
| app(nil,X26) = X26 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_13,plain,
! [X85,X86] :
( ~ ssList(X85)
| ~ ssList(X86)
| ssList(app(X85,X86)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X141] :
( ~ ssList(X141)
| segmentP(X141,X141) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_24,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_26,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]),c_0_28])]) ).
fof(c_0_31,plain,
! [X146,X147] :
( ( ~ neq(X146,X147)
| X146 != X147
| ~ ssList(X147)
| ~ ssList(X146) )
& ( X146 = X147
| neq(X146,X147)
| ~ ssList(X147)
| ~ ssList(X146) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
fof(c_0_32,plain,
! [X142] :
( ~ ssList(X142)
| segmentP(X142,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_33,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_34,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]),c_0_25])]) ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(esk4_0,nil)
| ~ neq(nil,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_35]),c_0_21]),c_0_25])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_42,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_37,c_0_16]) ).
cnf(c_0_43,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_44,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_35]),c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC092+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 02:20:37 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.ciKFzM3jdI/E---3.1_22034.p
% 0.61/0.56 # Version: 3.1pre001
% 0.61/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.61/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.61/0.56 # Starting sh5l with 300s (1) cores
% 0.61/0.56 # sh5l with pid 22114 completed with status 0
% 0.61/0.56 # Result found by sh5l
% 0.61/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.61/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.61/0.56 # Starting sh5l with 300s (1) cores
% 0.61/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.61/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.61/0.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.61/0.56 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 22117 completed with status 0
% 0.61/0.56 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.61/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.61/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.61/0.56 # Starting sh5l with 300s (1) cores
% 0.61/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.61/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.61/0.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.61/0.56 # Preprocessing time : 0.002 s
% 0.61/0.56 # Presaturation interreduction done
% 0.61/0.56
% 0.61/0.56 # Proof found!
% 0.61/0.56 # SZS status Theorem
% 0.61/0.56 # SZS output start CNFRefutation
% See solution above
% 0.61/0.56 # Parsed axioms : 96
% 0.61/0.56 # Removed by relevancy pruning/SinE : 12
% 0.61/0.56 # Initial clauses : 169
% 0.61/0.56 # Removed in clause preprocessing : 2
% 0.61/0.56 # Initial clauses in saturation : 167
% 0.61/0.56 # Processed clauses : 742
% 0.61/0.56 # ...of these trivial : 11
% 0.61/0.56 # ...subsumed : 158
% 0.61/0.56 # ...remaining for further processing : 573
% 0.61/0.56 # Other redundant clauses eliminated : 59
% 0.61/0.56 # Clauses deleted for lack of memory : 0
% 0.61/0.56 # Backward-subsumed : 26
% 0.61/0.56 # Backward-rewritten : 150
% 0.61/0.56 # Generated clauses : 1746
% 0.61/0.56 # ...of the previous two non-redundant : 1366
% 0.61/0.56 # ...aggressively subsumed : 0
% 0.61/0.56 # Contextual simplify-reflections : 53
% 0.61/0.56 # Paramodulations : 1683
% 0.61/0.56 # Factorizations : 0
% 0.61/0.56 # NegExts : 0
% 0.61/0.56 # Equation resolutions : 64
% 0.61/0.56 # Total rewrite steps : 2016
% 0.61/0.56 # Propositional unsat checks : 0
% 0.61/0.56 # Propositional check models : 0
% 0.61/0.56 # Propositional check unsatisfiable : 0
% 0.61/0.56 # Propositional clauses : 0
% 0.61/0.56 # Propositional clauses after purity: 0
% 0.61/0.56 # Propositional unsat core size : 0
% 0.61/0.56 # Propositional preprocessing time : 0.000
% 0.61/0.56 # Propositional encoding time : 0.000
% 0.61/0.56 # Propositional solver time : 0.000
% 0.61/0.56 # Success case prop preproc time : 0.000
% 0.61/0.56 # Success case prop encoding time : 0.000
% 0.61/0.56 # Success case prop solver time : 0.000
% 0.61/0.56 # Current number of processed clauses : 218
% 0.61/0.56 # Positive orientable unit clauses : 24
% 0.61/0.56 # Positive unorientable unit clauses: 0
% 0.61/0.56 # Negative unit clauses : 2
% 0.61/0.56 # Non-unit-clauses : 192
% 0.61/0.56 # Current number of unprocessed clauses: 838
% 0.61/0.56 # ...number of literals in the above : 4554
% 0.61/0.56 # Current number of archived formulas : 0
% 0.61/0.56 # Current number of archived clauses : 337
% 0.61/0.56 # Clause-clause subsumption calls (NU) : 25984
% 0.61/0.56 # Rec. Clause-clause subsumption calls : 10014
% 0.61/0.56 # Non-unit clause-clause subsumptions : 236
% 0.61/0.56 # Unit Clause-clause subsumption calls : 4085
% 0.61/0.56 # Rewrite failures with RHS unbound : 0
% 0.61/0.56 # BW rewrite match attempts : 20
% 0.61/0.56 # BW rewrite match successes : 20
% 0.61/0.56 # Condensation attempts : 0
% 0.61/0.56 # Condensation successes : 0
% 0.61/0.56 # Termbank termtop insertions : 43287
% 0.61/0.56
% 0.61/0.56 # -------------------------------------------------
% 0.61/0.56 # User time : 0.066 s
% 0.61/0.56 # System time : 0.001 s
% 0.61/0.56 # Total time : 0.067 s
% 0.61/0.56 # Maximum resident set size: 2396 pages
% 0.61/0.56
% 0.61/0.56 # -------------------------------------------------
% 0.61/0.56 # User time : 0.069 s
% 0.61/0.56 # System time : 0.003 s
% 0.61/0.56 # Total time : 0.073 s
% 0.61/0.56 # Maximum resident set size: 1804 pages
% 0.61/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------