TSTP Solution File: SWV408+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV408+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:11 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 65 ( 10 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 62 ( 22 ~; 26 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 41 ( 3 sgn; 25 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l44_co,conjecture,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ? [X5] :
( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)
& less_than(findmin_pqp_res(X1),X5) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nq3K2lbEBf/E---3.1_9269.p',l44_co) ).
fof(l44_l45,lemma,
! [X1,X2,X3] :
( ( contains_slb(X1,X2)
& strictly_less_than(X2,X3) )
=> ( pair_in_list(update_slb(X1,X3),X2,X3)
| ? [X4] :
( pair_in_list(update_slb(X1,X3),X2,X4)
& less_than(X3,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nq3K2lbEBf/E---3.1_9269.p',l44_l45) ).
fof(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Nq3K2lbEBf/E---3.1_9269.p',ax51) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox/tmp/tmp.Nq3K2lbEBf/E---3.1_9269.p',ax20) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ? [X5] :
( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)
& less_than(findmin_pqp_res(X1),X5) ) ) ),
inference(assume_negation,[status(cth)],[l44_co]) ).
fof(c_0_5,lemma,
! [X40,X41,X42] :
( ( pair_in_list(update_slb(X40,X42),X41,esk5_3(X40,X41,X42))
| pair_in_list(update_slb(X40,X42),X41,X42)
| ~ contains_slb(X40,X41)
| ~ strictly_less_than(X41,X42) )
& ( less_than(X42,esk5_3(X40,X41,X42))
| pair_in_list(update_slb(X40,X42),X41,X42)
| ~ contains_slb(X40,X41)
| ~ strictly_less_than(X41,X42) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l44_l45])])])]) ).
fof(c_0_6,negated_conjecture,
! [X10] :
( contains_slb(esk2_0,esk4_0)
& strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
& ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0))
& ( ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X10)
| ~ less_than(findmin_pqp_res(esk1_0),X10) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X30,X31,X32] :
( X31 = create_slb
| findmin_cpq_res(triple(X30,X31,X32)) = findmin_pqp_res(X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax51])])]) ).
cnf(c_0_8,lemma,
( pair_in_list(update_slb(X1,X2),X3,esk5_3(X1,X3,X2))
| pair_in_list(update_slb(X1,X2),X3,X2)
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
contains_slb(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,lemma,
( less_than(X1,esk5_3(X2,X3,X1))
| pair_in_list(update_slb(X2,X1),X3,X1)
| ~ contains_slb(X2,X3)
| ~ strictly_less_than(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( pair_in_list(update_slb(esk2_0,X1),esk4_0,esk5_3(esk2_0,esk4_0,X1))
| pair_in_list(update_slb(esk2_0,X1),esk4_0,X1)
| ~ strictly_less_than(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( esk2_0 = create_slb
| strictly_less_than(esk4_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( pair_in_list(update_slb(esk2_0,X1),esk4_0,X1)
| less_than(X1,esk5_3(esk2_0,esk4_0,X1))
| ~ strictly_less_than(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
fof(c_0_17,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
cnf(c_0_18,negated_conjecture,
( ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1)
| ~ less_than(findmin_pqp_res(esk1_0),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( esk2_0 = create_slb
| pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,esk5_3(esk2_0,esk4_0,findmin_pqp_res(esk1_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( esk2_0 = create_slb
| less_than(findmin_pqp_res(esk1_0),esk5_3(esk2_0,esk4_0,findmin_pqp_res(esk1_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_15]) ).
fof(c_0_21,plain,
! [X51] : ~ contains_slb(create_slb,X51),
inference(variable_rename,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
esk2_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV408+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 04:40:16 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.Nq3K2lbEBf/E---3.1_9269.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 9347 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 9350 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 43
% 0.20/0.52 # Removed by relevancy pruning/SinE : 19
% 0.20/0.52 # Initial clauses : 35
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 35
% 0.20/0.52 # Processed clauses : 261
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 123
% 0.20/0.52 # ...remaining for further processing : 138
% 0.20/0.52 # Other redundant clauses eliminated : 3
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 2
% 0.20/0.52 # Backward-rewritten : 23
% 0.20/0.52 # Generated clauses : 582
% 0.20/0.52 # ...of the previous two non-redundant : 473
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 3
% 0.20/0.52 # Paramodulations : 544
% 0.20/0.52 # Factorizations : 36
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 3
% 0.20/0.52 # Total rewrite steps : 147
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 76
% 0.20/0.52 # Positive orientable unit clauses : 11
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 4
% 0.20/0.52 # Non-unit-clauses : 61
% 0.20/0.52 # Current number of unprocessed clauses: 281
% 0.20/0.52 # ...number of literals in the above : 1220
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 60
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 2170
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1143
% 0.20/0.52 # Non-unit clause-clause subsumptions : 122
% 0.20/0.52 # Unit Clause-clause subsumption calls : 10
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 6
% 0.20/0.52 # BW rewrite match successes : 1
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 11397
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.023 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.027 s
% 0.20/0.52 # Maximum resident set size: 1848 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.025 s
% 0.20/0.52 # System time : 0.006 s
% 0.20/0.52 # Total time : 0.031 s
% 0.20/0.52 # Maximum resident set size: 1728 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------