TSTP Solution File: SWV144+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV144+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:56:12 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 143 ( 2 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 172 ( 47 ~; 31 |; 53 &)
% ( 1 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn; 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0014,conjecture,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_worst7,n3) ),
file('/export/starexec/sandbox/tmp/tmp.YNQSTmFkkO/E---3.1_25603.p',gauss_array_0014) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.YNQSTmFkkO/E---3.1_25603.p',leq_succ_gt) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/tmp/tmp.YNQSTmFkkO/E---3.1_25603.p',successor_1) ).
fof(c_0_3,plain,
( epred1_0
<=> ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) ) ),
introduced(definition) ).
fof(c_0_4,plain,
( epred1_0
=> ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_5,negated_conjecture,
~ ( epred1_0
=> leq(s_worst7,n3) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[gauss_array_0014])]),c_0_3]) ).
fof(c_0_6,plain,
( ( leq(tptp_float_0_001,pv1341)
| ~ epred1_0 )
& ( leq(n1,loopcounter)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3)
| ~ epred1_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3)
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_7,negated_conjecture,
( epred1_0
& ~ leq(s_worst7,n3) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( leq(s_worst7,n3)
| ~ gt(loopcounter,n0)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ leq(s_worst7,n3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X42,X43] :
( ~ leq(succ(X42),X43)
| gt(X43,X42) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
cnf(c_0_12,plain,
( leq(n1,loopcounter)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
~ gt(loopcounter,n0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),c_0_10]) ).
cnf(c_0_14,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_16,plain,
leq(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_9])]) ).
cnf(c_0_17,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV144+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 04:25:51 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 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.YNQSTmFkkO/E---3.1_25603.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # new_bool_1 with pid 25682 completed with status 0
% 0.22/0.53 # Result found by new_bool_1
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.53 # SAT001_MinMin_p005000_rr_RG with pid 25684 completed with status 0
% 0.22/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 85
% 0.22/0.53 # Removed by relevancy pruning/SinE : 29
% 0.22/0.53 # Initial clauses : 73
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 73
% 0.22/0.53 # Processed clauses : 130
% 0.22/0.53 # ...of these trivial : 6
% 0.22/0.53 # ...subsumed : 5
% 0.22/0.53 # ...remaining for further processing : 119
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 0
% 0.22/0.53 # Generated clauses : 39
% 0.22/0.53 # ...of the previous two non-redundant : 28
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 39
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Total rewrite steps : 39
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 57
% 0.22/0.53 # Positive orientable unit clauses : 51
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 3
% 0.22/0.53 # Non-unit-clauses : 3
% 0.22/0.53 # Current number of unprocessed clauses: 33
% 0.22/0.53 # ...number of literals in the above : 78
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 62
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 30
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 3
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 0
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 6
% 0.22/0.53 # BW rewrite match successes : 0
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 3979
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.006 s
% 0.22/0.53 # System time : 0.001 s
% 0.22/0.53 # Total time : 0.008 s
% 0.22/0.53 # Maximum resident set size: 1912 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.009 s
% 0.22/0.53 # System time : 0.005 s
% 0.22/0.53 # Total time : 0.013 s
% 0.22/0.53 # Maximum resident set size: 1788 pages
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------