TSTP Solution File: RNG123+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG123+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:15:51 EDT 2023
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 57 ( 3 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 65 ( 24 ~; 27 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn; 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.V2IesGpcm2/E---3.1_4016.p',mDefIdeal) ).
fof(m__2718,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/export/starexec/sandbox2/tmp/tmp.V2IesGpcm2/E---3.1_4016.p',m__2718) ).
fof(m__,conjecture,
aElementOf0(xr,xI),
file('/export/starexec/sandbox2/tmp/tmp.V2IesGpcm2/E---3.1_4016.p',m__) ).
fof(m__2690,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox2/tmp/tmp.V2IesGpcm2/E---3.1_4016.p',m__2690) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/tmp/tmp.V2IesGpcm2/E---3.1_4016.p',m__2174) ).
fof(m__2699,hypothesis,
aElementOf0(xb,xI),
file('/export/starexec/sandbox2/tmp/tmp.V2IesGpcm2/E---3.1_4016.p',m__2699) ).
fof(c_0_6,plain,
! [X60,X61,X62,X63,X64] :
( ( aSet0(X60)
| ~ aIdeal0(X60) )
& ( ~ aElementOf0(X62,X60)
| aElementOf0(sdtpldt0(X61,X62),X60)
| ~ aElementOf0(X61,X60)
| ~ aIdeal0(X60) )
& ( ~ aElement0(X63)
| aElementOf0(sdtasdt0(X63,X61),X60)
| ~ aElementOf0(X61,X60)
| ~ aIdeal0(X60) )
& ( aElementOf0(esk9_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( aElement0(esk11_1(X64))
| aElementOf0(esk10_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X64),esk9_1(X64)),X64)
| aElementOf0(esk10_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( aElement0(esk11_1(X64))
| ~ aElementOf0(sdtpldt0(esk9_1(X64),esk10_1(X64)),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X64),esk9_1(X64)),X64)
| ~ aElementOf0(sdtpldt0(esk9_1(X64),esk10_1(X64)),X64)
| ~ aSet0(X64)
| aIdeal0(X64) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefIdeal])])])])])]) ).
cnf(c_0_7,plain,
( aElementOf0(sdtpldt0(X3,X1),X2)
| ~ aElementOf0(X1,X2)
| ~ aElementOf0(X3,X2)
| ~ aIdeal0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[m__2718]) ).
fof(c_0_9,negated_conjecture,
~ aElementOf0(xr,xI),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_10,hypothesis,
( aElementOf0(xr,X1)
| ~ aIdeal0(X1)
| ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),X1)
| ~ aElementOf0(xb,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[m__2690]) ).
cnf(c_0_12,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xb,xI),
inference(split_conjunct,[status(thm)],[m__2699]) ).
cnf(c_0_14,negated_conjecture,
~ aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG123+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n001.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 : Mon Oct 2 20:19:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.V2IesGpcm2/E---3.1_4016.p
% 0.20/0.54 # Version: 3.1pre001
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4187 completed with status 0
% 0.20/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSF-FSMM32-MFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.54 # Starting sh5l with 136s (1) cores
% 0.20/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4199 completed with status 0
% 0.20/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSF-FSMM32-MFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.54 # Preprocessing time : 0.003 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Theorem
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 55
% 0.20/0.54 # Removed by relevancy pruning/SinE : 0
% 0.20/0.54 # Initial clauses : 123
% 0.20/0.54 # Removed in clause preprocessing : 4
% 0.20/0.54 # Initial clauses in saturation : 119
% 0.20/0.54 # Processed clauses : 443
% 0.20/0.54 # ...of these trivial : 14
% 0.20/0.54 # ...subsumed : 79
% 0.20/0.54 # ...remaining for further processing : 350
% 0.20/0.54 # Other redundant clauses eliminated : 18
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 9
% 0.20/0.54 # Backward-rewritten : 6
% 0.20/0.54 # Generated clauses : 821
% 0.20/0.54 # ...of the previous two non-redundant : 682
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 5
% 0.20/0.54 # Paramodulations : 805
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 18
% 0.20/0.54 # Total rewrite steps : 445
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 202
% 0.20/0.54 # Positive orientable unit clauses : 47
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 7
% 0.20/0.54 # Non-unit-clauses : 148
% 0.20/0.54 # Current number of unprocessed clauses: 421
% 0.20/0.54 # ...number of literals in the above : 2281
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 134
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 3404
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 1113
% 0.20/0.54 # Non-unit clause-clause subsumptions : 91
% 0.20/0.54 # Unit Clause-clause subsumption calls : 12
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 10
% 0.20/0.54 # BW rewrite match successes : 6
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 20933
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.038 s
% 0.20/0.54 # System time : 0.008 s
% 0.20/0.54 # Total time : 0.046 s
% 0.20/0.54 # Maximum resident set size: 2048 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.190 s
% 0.20/0.54 # System time : 0.015 s
% 0.20/0.54 # Total time : 0.205 s
% 0.20/0.54 # Maximum resident set size: 1744 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------