TSTP Solution File: SWV374+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV374+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:52:53 EDT 2024
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 7 unt; 0 def)
% Number of atoms : 97 ( 33 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 93 ( 32 ~; 36 |; 16 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 75 ( 16 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/tmp/tmp.jsuCJLUWat/E---3.1_30519.p',ax48) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/tmp/tmp.jsuCJLUWat/E---3.1_30519.p',ax47) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.jsuCJLUWat/E---3.1_30519.p',stricly_smaller_definition) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/tmp/tmp.jsuCJLUWat/E---3.1_30519.p',ax40) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.jsuCJLUWat/E---3.1_30519.p',totality) ).
fof(l10_co,conjecture,
! [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
=> ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.jsuCJLUWat/E---3.1_30519.p',l10_co) ).
fof(ax46,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox/tmp/tmp.jsuCJLUWat/E---3.1_30519.p',ax46) ).
fof(c_0_7,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax48]) ).
fof(c_0_8,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax47]) ).
fof(c_0_9,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_10,plain,
! [X39,X40] :
( ( ~ ok(triple(X39,X40,bad))
| ~ $true )
& ( $true
| ok(triple(X39,X40,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
fof(c_0_11,plain,
! [X18,X19,X20] :
( X19 = create_slb
| ~ contains_slb(X19,findmin_pqp_res(X18))
| ~ strictly_less_than(findmin_pqp_res(X18),lookup_slb(X19,findmin_pqp_res(X18)))
| findmin_cpq_eff(triple(X18,X19,X20)) = triple(X18,update_slb(X19,findmin_pqp_res(X18)),bad) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])]) ).
fof(c_0_12,plain,
! [X15,X16,X17] :
( X16 = create_slb
| contains_slb(X16,findmin_pqp_res(X15))
| findmin_cpq_eff(triple(X15,X16,X17)) = triple(X15,update_slb(X16,findmin_pqp_res(X15)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])]) ).
fof(c_0_13,plain,
! [X61,X62] :
( ( less_than(X61,X62)
| ~ strictly_less_than(X61,X62) )
& ( ~ less_than(X62,X61)
| ~ strictly_less_than(X61,X62) )
& ( ~ less_than(X61,X62)
| less_than(X62,X61)
| strictly_less_than(X61,X62) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_14,plain,
! [X12,X13] :
( less_than(X12,X13)
| less_than(X13,X12) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_15,plain,
( ~ ok(triple(X1,X2,bad))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
=> ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l10_co])]) ).
cnf(c_0_17,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_15]) ).
fof(c_0_22,negated_conjecture,
( ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ( esk2_0 = create_slb
| ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| ~ less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_23,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) ),
inference(csr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( esk2_0 = create_slb
| ~ contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| ~ less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) = triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad)
| esk2_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( esk2_0 = create_slb
| ~ ok(findmin_cpq_eff(triple(esk1_0,esk2_0,X1))) ),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
fof(c_0_32,plain,
! [X46,X47] : findmin_cpq_eff(triple(X46,create_slb,X47)) = triple(X46,create_slb,bad),
inference(variable_rename,[status(thm)],[ax46]) ).
cnf(c_0_33,negated_conjecture,
esk2_0 = create_slb,
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_34,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_33]),c_0_34]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWV374+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n029.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 17:01:38 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.jsuCJLUWat/E---3.1_30519.p
% 0.15/0.47 # Version: 3.1.0
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # new_bool_3 with pid 30602 completed with status 0
% 0.15/0.47 # Result found by new_bool_3
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.15/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 30605 completed with status 0
% 0.15/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.15/0.47 # Preprocessing time : 0.001 s
% 0.15/0.47 # Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 # Proof found!
% 0.15/0.47 # SZS status Theorem
% 0.15/0.47 # SZS output start CNFRefutation
% See solution above
% 0.15/0.47 # Parsed axioms : 42
% 0.15/0.47 # Removed by relevancy pruning/SinE : 17
% 0.15/0.47 # Initial clauses : 31
% 0.15/0.47 # Removed in clause preprocessing : 1
% 0.15/0.47 # Initial clauses in saturation : 30
% 0.15/0.47 # Processed clauses : 471
% 0.15/0.47 # ...of these trivial : 0
% 0.15/0.47 # ...subsumed : 331
% 0.15/0.47 # ...remaining for further processing : 140
% 0.15/0.47 # Other redundant clauses eliminated : 1
% 0.15/0.47 # Clauses deleted for lack of memory : 0
% 0.15/0.47 # Backward-subsumed : 2
% 0.15/0.47 # Backward-rewritten : 25
% 0.15/0.47 # Generated clauses : 1914
% 0.15/0.47 # ...of the previous two non-redundant : 1730
% 0.15/0.47 # ...aggressively subsumed : 0
% 0.15/0.47 # Contextual simplify-reflections : 3
% 0.15/0.47 # Paramodulations : 1671
% 0.15/0.47 # Factorizations : 242
% 0.15/0.47 # NegExts : 0
% 0.15/0.47 # Equation resolutions : 1
% 0.15/0.47 # Disequality decompositions : 0
% 0.15/0.47 # Total rewrite steps : 253
% 0.15/0.47 # ...of those cached : 176
% 0.15/0.47 # Propositional unsat checks : 0
% 0.15/0.47 # Propositional check models : 0
% 0.15/0.47 # Propositional check unsatisfiable : 0
% 0.15/0.47 # Propositional clauses : 0
% 0.15/0.47 # Propositional clauses after purity: 0
% 0.15/0.47 # Propositional unsat core size : 0
% 0.15/0.47 # Propositional preprocessing time : 0.000
% 0.15/0.47 # Propositional encoding time : 0.000
% 0.15/0.47 # Propositional solver time : 0.000
% 0.15/0.47 # Success case prop preproc time : 0.000
% 0.15/0.47 # Success case prop encoding time : 0.000
% 0.15/0.47 # Success case prop solver time : 0.000
% 0.15/0.47 # Current number of processed clauses : 82
% 0.15/0.47 # Positive orientable unit clauses : 11
% 0.15/0.47 # Positive unorientable unit clauses: 0
% 0.15/0.47 # Negative unit clauses : 2
% 0.15/0.47 # Non-unit-clauses : 69
% 0.15/0.47 # Current number of unprocessed clauses: 1319
% 0.15/0.47 # ...number of literals in the above : 8253
% 0.15/0.47 # Current number of archived formulas : 0
% 0.15/0.47 # Current number of archived clauses : 57
% 0.15/0.47 # Clause-clause subsumption calls (NU) : 5357
% 0.15/0.47 # Rec. Clause-clause subsumption calls : 2438
% 0.15/0.47 # Non-unit clause-clause subsumptions : 329
% 0.15/0.47 # Unit Clause-clause subsumption calls : 30
% 0.15/0.47 # Rewrite failures with RHS unbound : 0
% 0.15/0.47 # BW rewrite match attempts : 7
% 0.15/0.47 # BW rewrite match successes : 1
% 0.15/0.47 # Condensation attempts : 0
% 0.15/0.47 # Condensation successes : 0
% 0.15/0.47 # Termbank termtop insertions : 41048
% 0.15/0.47 # Search garbage collected termcells : 485
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.055 s
% 0.15/0.47 # System time : 0.003 s
% 0.15/0.47 # Total time : 0.058 s
% 0.15/0.47 # Maximum resident set size: 1860 pages
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.057 s
% 0.15/0.47 # System time : 0.004 s
% 0.15/0.47 # Total time : 0.062 s
% 0.15/0.47 # Maximum resident set size: 1740 pages
% 0.15/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------