TSTP Solution File: SWV415+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV415+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:44:35 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 56 ( 9 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp.8xGyq2fZjn/E---3.1_21647.p',co2) ).
fof(main2_l12,lemma,
! [X1,X2,X3,X4,X5] : i(triple(X1,X3,X4)) = i(triple(X2,X3,X5)),
file('/export/starexec/sandbox/tmp/tmp.8xGyq2fZjn/E---3.1_21647.p',main2_l12) ).
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/sandbox/tmp/tmp.8xGyq2fZjn/E---3.1_21647.p',ax42) ).
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/sandbox/tmp/tmp.8xGyq2fZjn/E---3.1_21647.p',ax55) ).
fof(c_0_4,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]) ).
fof(c_0_5,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_4])])]) ).
fof(c_0_6,lemma,
! [X30,X31,X32,X33,X34] : i(triple(X30,X32,X33)) = i(triple(X31,X32,X34)),
inference(variable_rename,[status(thm)],[main2_l12]) ).
fof(c_0_7,plain,
! [X68,X69,X70,X71] : insert_cpq(triple(X68,X69,X70),X71) = triple(insert_pqp(X68,X71),insert_slb(X69,pair(X71,bottom)),X70),
inference(variable_rename,[status(thm)],[ax42]) ).
fof(c_0_8,plain,
! [X23,X24,X25,X26,X27] : i(triple(X23,insert_slb(X24,pair(X26,X27)),X25)) = insert_pq(i(triple(X23,X24,X25)),X26),
inference(variable_rename,[status(thm)],[ax55]) ).
cnf(c_0_9,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_5]) ).
cnf(c_0_10,lemma,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,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_7]) ).
cnf(c_0_12,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_8]) ).
cnf(c_0_13,negated_conjecture,
i(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) != insert_pq(i(triple(bottom,esk2_0,bottom)),esk4_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,lemma,
i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X5,X2,X6)),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWV415+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 04:44:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.8xGyq2fZjn/E---3.1_21647.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # sh5l with pid 21728 completed with status 0
% 0.20/0.53 # Result found by sh5l
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.53 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 21736 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.53 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.20/0.53 # Preprocessing time : 0.004 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 64
% 0.20/0.53 # Removed by relevancy pruning/SinE : 11
% 0.20/0.53 # Initial clauses : 69
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 69
% 0.20/0.53 # Processed clauses : 310
% 0.20/0.53 # ...of these trivial : 6
% 0.20/0.53 # ...subsumed : 61
% 0.20/0.53 # ...remaining for further processing : 243
% 0.20/0.53 # Other redundant clauses eliminated : 2
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 15
% 0.20/0.53 # Backward-rewritten : 2
% 0.20/0.53 # Generated clauses : 670
% 0.20/0.53 # ...of the previous two non-redundant : 535
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 4
% 0.20/0.53 # Paramodulations : 664
% 0.20/0.53 # Factorizations : 4
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 2
% 0.20/0.53 # Total rewrite steps : 101
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 155
% 0.20/0.53 # Positive orientable unit clauses : 28
% 0.20/0.53 # Positive unorientable unit clauses: 4
% 0.20/0.53 # Negative unit clauses : 17
% 0.20/0.53 # Non-unit-clauses : 106
% 0.20/0.53 # Current number of unprocessed clauses: 354
% 0.20/0.53 # ...number of literals in the above : 1243
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 86
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 4822
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 2831
% 0.20/0.53 # Non-unit clause-clause subsumptions : 21
% 0.20/0.53 # Unit Clause-clause subsumption calls : 254
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 28
% 0.20/0.53 # BW rewrite match successes : 19
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 14849
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.017 s
% 0.20/0.53 # System time : 0.007 s
% 0.20/0.53 # Total time : 0.023 s
% 0.20/0.53 # Maximum resident set size: 2084 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.017 s
% 0.20/0.53 # System time : 0.009 s
% 0.20/0.53 # Total time : 0.026 s
% 0.20/0.53 # Maximum resident set size: 1748 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------