TSTP Solution File: SWV415+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV415+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:57:12 EDT 2023
% Result : Theorem 3.33s 0.98s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 34 unt; 0 def)
% Number of atoms : 56 ( 55 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 28 ( 13 ~; 11 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 26 usr; 18 con; 0-3 aty)
% Number of variables : 182 ( 57 sgn; 69 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(big2_induction,axiom,
( ( ! [X1,X2,X3,X4] : i(triple(X1,create_slb,X3)) = i(triple(X2,create_slb,X4))
& ! [X5] :
( ! [X6,X7,X8,X9] : i(triple(X6,X5,X8)) = i(triple(X7,X5,X9))
=> ! [X10,X11,X12,X13,X14,X15] : i(triple(X10,insert_slb(X5,pair(X14,X15)),X12)) = i(triple(X11,insert_slb(X5,pair(X14,X15)),X13)) ) )
=> ! [X16,X17,X18,X19,X20] : i(triple(X16,X18,X19)) = i(triple(X17,X18,X20)) ),
file('/export/starexec/sandbox2/tmp/tmp.8kgGD61NUo/E---3.1_1782.p',big2_induction) ).
fof(ax54,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('/export/starexec/sandbox2/tmp/tmp.8kgGD61NUo/E---3.1_1782.p',ax54) ).
fof(ax17,axiom,
! [X1,X2,X3] : insert_pq(insert_pq(X1,X2),X3) = insert_pq(insert_pq(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/tmp.8kgGD61NUo/E---3.1_1782.p',ax17) ).
fof(ax55,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox2/tmp/tmp.8kgGD61NUo/E---3.1_1782.p',ax55) ).
fof(ax42,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/export/starexec/sandbox2/tmp/tmp.8kgGD61NUo/E---3.1_1782.p',ax42) ).
fof(co2,conjecture,
! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox2/tmp/tmp.8kgGD61NUo/E---3.1_1782.p',co2) ).
fof(ax11,axiom,
! [X1,X2] : remove_pq(insert_pq(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.8kgGD61NUo/E---3.1_1782.p',ax11) ).
fof(c_0_7,plain,
! [X50,X51,X52,X53,X60,X61,X62,X63,X64] :
( ( i(triple(X50,esk9_0,X52)) = i(triple(X51,esk9_0,X53))
| i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
| i(triple(X60,X62,X63)) = i(triple(X61,X62,X64)) )
& ( i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0))
| i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
| i(triple(X60,X62,X63)) = i(triple(X61,X62,X64)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[big2_induction])])])])]) ).
fof(c_0_8,plain,
! [X43,X44] : i(triple(X43,create_slb,X44)) = create_pq,
inference(variable_rename,[status(thm)],[ax54]) ).
fof(c_0_9,plain,
! [X35,X36,X37] : insert_pq(insert_pq(X35,X36),X37) = insert_pq(insert_pq(X35,X37),X36),
inference(variable_rename,[status(thm)],[ax17]) ).
fof(c_0_10,plain,
! [X38,X39,X40,X41,X42] : i(triple(X38,insert_slb(X39,pair(X41,X42)),X40)) = insert_pq(i(triple(X38,X39,X40)),X41),
inference(variable_rename,[status(thm)],[ax55]) ).
fof(c_0_11,plain,
! [X98,X99,X100,X101] : insert_cpq(triple(X98,X99,X100),X101) = triple(insert_pqp(X98,X101),insert_slb(X99,pair(X101,bottom)),X100),
inference(variable_rename,[status(thm)],[ax42]) ).
cnf(c_0_12,plain,
( i(triple(X1,esk9_0,X2)) = i(triple(X3,esk9_0,X4))
| i(triple(X5,X6,X7)) = i(triple(X8,X6,X9))
| i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
insert_pq(insert_pq(X1,X2),X3) = insert_pq(insert_pq(X1,X3),X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0))
| i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( i(triple(X1,esk9_0,X2)) = i(triple(X3,esk9_0,X4))
| i(triple(X5,X6,X7)) = i(triple(X8,X6,X9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13])]) ).
cnf(c_0_19,plain,
i(triple(X1,insert_slb(insert_slb(X2,pair(X3,X4)),pair(X5,bottom)),X6)) = i(triple(X1,insert_slb(insert_slb(X2,pair(X5,bottom)),pair(X3,bottom)),X6)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_20,plain,
i(triple(insert_pqp(X1,X2),insert_slb(insert_slb(X3,pair(X2,bottom)),pair(X4,X5)),X6)) = insert_pq(i(insert_cpq(triple(X1,X3,X6),X2)),X4),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13]),c_0_13])]) ).
cnf(c_0_22,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = i(triple(X1,insert_slb(X2,pair(X3,X6)),X5)),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_23,plain,
i(triple(X1,esk9_0,X2)) = i(triple(X3,esk9_0,X4)),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_18]),c_0_18]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
inference(assume_negation,[status(cth)],[co2]) ).
cnf(c_0_25,plain,
insert_pq(i(insert_cpq(triple(X1,X2,X3),X4)),X5) = i(insert_cpq(triple(X1,insert_slb(X2,pair(X5,bottom)),X3),X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).
cnf(c_0_26,plain,
( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
| i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,bottom)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,bottom)),esk13_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_27,plain,
i(triple(X1,insert_slb(esk9_0,pair(X2,X3)),X4)) = i(triple(X5,insert_slb(esk9_0,pair(X2,bottom)),X6)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_15]) ).
fof(c_0_28,negated_conjecture,
i(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != insert_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_29,plain,
i(triple(insert_pqp(X1,X2),insert_slb(insert_slb(X3,pair(X2,bottom)),pair(X4,X5)),X6)) = i(insert_cpq(triple(X1,insert_slb(X3,pair(X4,bottom)),X6),X2)),
inference(rw,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_30,plain,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27])]) ).
fof(c_0_31,plain,
! [X30,X31] : remove_pq(insert_pq(X30,X31),X31) = X30,
inference(variable_rename,[status(thm)],[ax11]) ).
cnf(c_0_32,negated_conjecture,
i(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != insert_pq(i(triple(esk1_0,esk2_0,esk3_0)),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
i(triple(bottom,insert_slb(insert_slb(X1,pair(X2,bottom)),pair(X3,X4)),bottom)) = i(insert_cpq(triple(X5,insert_slb(X1,pair(X3,bottom)),X6),X2)),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
remove_pq(insert_pq(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
i(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != i(triple(esk1_0,insert_slb(esk2_0,pair(esk4_0,bottom)),esk3_0)),
inference(rw,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_36,plain,
insert_pq(i(insert_cpq(triple(X1,X2,X3),X4)),X5) = i(triple(bottom,insert_slb(insert_slb(X2,pair(X4,bottom)),pair(X5,bottom)),bottom)),
inference(rw,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_37,plain,
remove_pq(i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)),X3) = i(triple(X1,X2,X5)),
inference(spm,[status(thm)],[c_0_34,c_0_15]) ).
cnf(c_0_38,negated_conjecture,
i(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != i(triple(bottom,insert_slb(esk2_0,pair(esk4_0,bottom)),bottom)),
inference(rw,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_39,plain,
i(insert_cpq(triple(X1,X2,X3),X4)) = i(triple(bottom,insert_slb(X2,pair(X4,bottom)),bottom)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_36]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV415+2 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 03:48:28 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.8kgGD61NUo/E---3.1_1782.p
% 3.33/0.98 # Version: 3.1pre001
% 3.33/0.98 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.33/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/0.98 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.33/0.98 # Starting new_bool_3 with 300s (1) cores
% 3.33/0.98 # Starting new_bool_1 with 300s (1) cores
% 3.33/0.98 # Starting sh5l with 300s (1) cores
% 3.33/0.98 # sh5l with pid 1869 completed with status 0
% 3.33/0.98 # Result found by sh5l
% 3.33/0.98 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.33/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/0.98 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.33/0.98 # Starting new_bool_3 with 300s (1) cores
% 3.33/0.98 # Starting new_bool_1 with 300s (1) cores
% 3.33/0.98 # Starting sh5l with 300s (1) cores
% 3.33/0.98 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.33/0.98 # Search class: FGHSM-FFMF31-MFFFFFNN
% 3.33/0.98 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.33/0.98 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 3.33/0.98 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 1872 completed with status 0
% 3.33/0.98 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 3.33/0.98 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.33/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/0.98 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.33/0.98 # Starting new_bool_3 with 300s (1) cores
% 3.33/0.98 # Starting new_bool_1 with 300s (1) cores
% 3.33/0.98 # Starting sh5l with 300s (1) cores
% 3.33/0.98 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.33/0.98 # Search class: FGHSM-FFMF31-MFFFFFNN
% 3.33/0.98 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.33/0.98 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 3.33/0.98 # Preprocessing time : 0.002 s
% 3.33/0.98 # Presaturation interreduction done
% 3.33/0.98
% 3.33/0.98 # Proof found!
% 3.33/0.98 # SZS status Theorem
% 3.33/0.98 # SZS output start CNFRefutation
% See solution above
% 3.33/0.98 # Parsed axioms : 64
% 3.33/0.98 # Removed by relevancy pruning/SinE : 11
% 3.33/0.98 # Initial clauses : 70
% 3.33/0.98 # Removed in clause preprocessing : 0
% 3.33/0.98 # Initial clauses in saturation : 70
% 3.33/0.98 # Processed clauses : 3054
% 3.33/0.98 # ...of these trivial : 60
% 3.33/0.98 # ...subsumed : 1853
% 3.33/0.98 # ...remaining for further processing : 1141
% 3.33/0.98 # Other redundant clauses eliminated : 2
% 3.33/0.98 # Clauses deleted for lack of memory : 0
% 3.33/0.98 # Backward-subsumed : 30
% 3.33/0.98 # Backward-rewritten : 109
% 3.33/0.98 # Generated clauses : 24717
% 3.33/0.98 # ...of the previous two non-redundant : 22036
% 3.33/0.98 # ...aggressively subsumed : 0
% 3.33/0.98 # Contextual simplify-reflections : 10
% 3.33/0.98 # Paramodulations : 24615
% 3.33/0.98 # Factorizations : 100
% 3.33/0.98 # NegExts : 0
% 3.33/0.98 # Equation resolutions : 2
% 3.33/0.98 # Total rewrite steps : 6761
% 3.33/0.98 # Propositional unsat checks : 0
% 3.33/0.98 # Propositional check models : 0
% 3.33/0.98 # Propositional check unsatisfiable : 0
% 3.33/0.98 # Propositional clauses : 0
% 3.33/0.98 # Propositional clauses after purity: 0
% 3.33/0.98 # Propositional unsat core size : 0
% 3.33/0.98 # Propositional preprocessing time : 0.000
% 3.33/0.98 # Propositional encoding time : 0.000
% 3.33/0.98 # Propositional solver time : 0.000
% 3.33/0.98 # Success case prop preproc time : 0.000
% 3.33/0.98 # Success case prop encoding time : 0.000
% 3.33/0.98 # Success case prop solver time : 0.000
% 3.33/0.98 # Current number of processed clauses : 930
% 3.33/0.98 # Positive orientable unit clauses : 148
% 3.33/0.98 # Positive unorientable unit clauses: 25
% 3.33/0.98 # Negative unit clauses : 115
% 3.33/0.98 # Non-unit-clauses : 642
% 3.33/0.98 # Current number of unprocessed clauses: 18882
% 3.33/0.98 # ...number of literals in the above : 59945
% 3.33/0.98 # Current number of archived formulas : 0
% 3.33/0.98 # Current number of archived clauses : 209
% 3.33/0.98 # Clause-clause subsumption calls (NU) : 122086
% 3.33/0.98 # Rec. Clause-clause subsumption calls : 60736
% 3.33/0.98 # Non-unit clause-clause subsumptions : 1381
% 3.33/0.98 # Unit Clause-clause subsumption calls : 19378
% 3.33/0.98 # Rewrite failures with RHS unbound : 0
% 3.33/0.98 # BW rewrite match attempts : 1405
% 3.33/0.98 # BW rewrite match successes : 381
% 3.33/0.98 # Condensation attempts : 0
% 3.33/0.98 # Condensation successes : 0
% 3.33/0.98 # Termbank termtop insertions : 439961
% 3.33/0.98
% 3.33/0.98 # -------------------------------------------------
% 3.33/0.98 # User time : 0.461 s
% 3.33/0.98 # System time : 0.021 s
% 3.33/0.98 # Total time : 0.482 s
% 3.33/0.98 # Maximum resident set size: 2080 pages
% 3.33/0.98
% 3.33/0.98 # -------------------------------------------------
% 3.33/0.98 # User time : 0.464 s
% 3.33/0.98 # System time : 0.022 s
% 3.33/0.98 # Total time : 0.486 s
% 3.33/0.98 # Maximum resident set size: 1768 pages
% 3.33/0.98 % E---3.1 exiting
%------------------------------------------------------------------------------