TSTP Solution File: NUM602+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM602+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:07:55 EDT 2023
% Result : Theorem 51.85s 7.19s
% Output : CNFRefutation 51.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 48 ( 18 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 55 ( 20 ~; 17 |; 17 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn; 4 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& sdtlpdtrp0(xe,X1) = xx ),
file('/export/starexec/sandbox/tmp/tmp.y3AOUDgN7L/E---3.1_3842.p',m__) ).
fof(m__4982,hypothesis,
! [X1] :
( ( ? [X2] :
( aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X2) = X1 )
| aElementOf0(X1,xO) )
=> ? [X2] :
( aElementOf0(X2,szNzAzT0)
& sdtlpdtrp0(xd,X2) = szDzizrdt0(xd)
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X2) = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.y3AOUDgN7L/E---3.1_3842.p',m__4982) ).
fof(m__5009,hypothesis,
( ? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X1) = xx )
& aElementOf0(xx,xO) ),
file('/export/starexec/sandbox/tmp/tmp.y3AOUDgN7L/E---3.1_3842.p',m__5009) ).
fof(c_0_3,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& sdtlpdtrp0(xe,X1) = xx ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,negated_conjecture,
! [X246] :
( ~ aElementOf0(X246,szNzAzT0)
| sdtlpdtrp0(xe,X246) != xx ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_5,hypothesis,
! [X242,X243] :
( ( aElementOf0(esk39_1(X242),szNzAzT0)
| ~ aElementOf0(X243,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,X243) != X242 )
& ( sdtlpdtrp0(xd,esk39_1(X242)) = szDzizrdt0(xd)
| ~ aElementOf0(X243,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,X243) != X242 )
& ( aElementOf0(esk39_1(X242),sdtlbdtrb0(xd,szDzizrdt0(xd)))
| ~ aElementOf0(X243,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,X243) != X242 )
& ( sdtlpdtrp0(xe,esk39_1(X242)) = X242
| ~ aElementOf0(X243,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,X243) != X242 )
& ( aElementOf0(esk39_1(X242),szNzAzT0)
| ~ aElementOf0(X242,xO) )
& ( sdtlpdtrp0(xd,esk39_1(X242)) = szDzizrdt0(xd)
| ~ aElementOf0(X242,xO) )
& ( aElementOf0(esk39_1(X242),sdtlbdtrb0(xd,szDzizrdt0(xd)))
| ~ aElementOf0(X242,xO) )
& ( sdtlpdtrp0(xe,esk39_1(X242)) = X242
| ~ aElementOf0(X242,xO) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4982])])])])]) ).
fof(c_0_6,hypothesis,
( aElementOf0(esk40_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,esk40_0) = xx
& aElementOf0(xx,xO) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__5009])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlpdtrp0(xe,X1) != xx ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
( sdtlpdtrp0(xe,esk39_1(X1)) = X1
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
aElementOf0(xx,xO),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ aElementOf0(esk39_1(xx),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]),c_0_9])]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(esk39_1(X1),szNzAzT0)
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : NUM602+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 13:13:10 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.y3AOUDgN7L/E---3.1_3842.p
% 51.85/7.19 # Version: 3.1pre001
% 51.85/7.19 # Preprocessing class: FSLSSMSMSSSNFFN.
% 51.85/7.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.85/7.19 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 51.85/7.19 # Starting new_bool_3 with 300s (1) cores
% 51.85/7.19 # Starting new_bool_1 with 300s (1) cores
% 51.85/7.19 # Starting sh5l with 300s (1) cores
% 51.85/7.19 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3953 completed with status 0
% 51.85/7.19 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 51.85/7.19 # Preprocessing class: FSLSSMSMSSSNFFN.
% 51.85/7.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.85/7.19 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 51.85/7.19 # No SInE strategy applied
% 51.85/7.19 # Search class: FGHSF-SMLM32-MFFFFFNN
% 51.85/7.19 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 51.85/7.19 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 51.85/7.19 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 51.85/7.19 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 51.85/7.19 # Starting new_bool_3 with 136s (1) cores
% 51.85/7.19 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 51.85/7.19 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3959 completed with status 0
% 51.85/7.19 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 51.85/7.19 # Preprocessing class: FSLSSMSMSSSNFFN.
% 51.85/7.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.85/7.19 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 51.85/7.19 # No SInE strategy applied
% 51.85/7.19 # Search class: FGHSF-SMLM32-MFFFFFNN
% 51.85/7.19 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 51.85/7.19 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 51.85/7.19 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 51.85/7.19 # Preprocessing time : 0.105 s
% 51.85/7.19 # Presaturation interreduction done
% 51.85/7.19
% 51.85/7.19 # Proof found!
% 51.85/7.19 # SZS status Theorem
% 51.85/7.19 # SZS output start CNFRefutation
% See solution above
% 51.85/7.19 # Parsed axioms : 99
% 51.85/7.19 # Removed by relevancy pruning/SinE : 0
% 51.85/7.19 # Initial clauses : 4878
% 51.85/7.19 # Removed in clause preprocessing : 7
% 51.85/7.19 # Initial clauses in saturation : 4871
% 51.85/7.19 # Processed clauses : 6834
% 51.85/7.19 # ...of these trivial : 2
% 51.85/7.19 # ...subsumed : 889
% 51.85/7.19 # ...remaining for further processing : 5943
% 51.85/7.19 # Other redundant clauses eliminated : 2045
% 51.85/7.19 # Clauses deleted for lack of memory : 0
% 51.85/7.19 # Backward-subsumed : 18
% 51.85/7.19 # Backward-rewritten : 0
% 51.85/7.19 # Generated clauses : 1910
% 51.85/7.19 # ...of the previous two non-redundant : 1886
% 51.85/7.19 # ...aggressively subsumed : 0
% 51.85/7.19 # Contextual simplify-reflections : 69
% 51.85/7.19 # Paramodulations : 65
% 51.85/7.19 # Factorizations : 0
% 51.85/7.19 # NegExts : 0
% 51.85/7.19 # Equation resolutions : 2045
% 51.85/7.19 # Total rewrite steps : 105
% 51.85/7.19 # Propositional unsat checks : 2
% 51.85/7.19 # Propositional check models : 2
% 51.85/7.19 # Propositional check unsatisfiable : 0
% 51.85/7.19 # Propositional clauses : 0
% 51.85/7.19 # Propositional clauses after purity: 0
% 51.85/7.19 # Propositional unsat core size : 0
% 51.85/7.19 # Propositional preprocessing time : 0.000
% 51.85/7.19 # Propositional encoding time : 0.045
% 51.85/7.19 # Propositional solver time : 0.002
% 51.85/7.19 # Success case prop preproc time : 0.000
% 51.85/7.19 # Success case prop encoding time : 0.000
% 51.85/7.19 # Success case prop solver time : 0.000
% 51.85/7.19 # Current number of processed clauses : 114
% 51.85/7.19 # Positive orientable unit clauses : 50
% 51.85/7.19 # Positive unorientable unit clauses: 0
% 51.85/7.19 # Negative unit clauses : 11
% 51.85/7.19 # Non-unit-clauses : 53
% 51.85/7.19 # Current number of unprocessed clauses: 3891
% 51.85/7.19 # ...number of literals in the above : 44114
% 51.85/7.19 # Current number of archived formulas : 0
% 51.85/7.19 # Current number of archived clauses : 3987
% 51.85/7.19 # Clause-clause subsumption calls (NU) : 10714840
% 51.85/7.19 # Rec. Clause-clause subsumption calls : 71641
% 51.85/7.19 # Non-unit clause-clause subsumptions : 969
% 51.85/7.19 # Unit Clause-clause subsumption calls : 253
% 51.85/7.19 # Rewrite failures with RHS unbound : 0
% 51.85/7.19 # BW rewrite match attempts : 0
% 51.85/7.19 # BW rewrite match successes : 0
% 51.85/7.19 # Condensation attempts : 0
% 51.85/7.19 # Condensation successes : 0
% 51.85/7.19 # Termbank termtop insertions : 852632
% 51.85/7.19
% 51.85/7.19 # -------------------------------------------------
% 51.85/7.19 # User time : 6.039 s
% 51.85/7.19 # System time : 0.031 s
% 51.85/7.19 # Total time : 6.070 s
% 51.85/7.19 # Maximum resident set size: 14232 pages
% 51.85/7.19
% 51.85/7.19 # -------------------------------------------------
% 51.85/7.19 # User time : 31.997 s
% 51.85/7.19 # System time : 0.116 s
% 51.85/7.19 # Total time : 32.113 s
% 51.85/7.19 # Maximum resident set size: 1848 pages
% 51.85/7.19 % E---3.1 exiting
%------------------------------------------------------------------------------