TSTP Solution File: RNG124+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG124+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:52 EDT 2023
% Result : ContradictoryAxioms 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 58 ( 21 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 62 ( 17 ~; 12 |; 31 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn; 5 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2273,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dG8BWRzO4N/E---3.1_20851.p',m__2273) ).
fof(m__2729,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xr )
& aElementOf0(xr,xI) ),
file('/export/starexec/sandbox2/tmp/tmp.dG8BWRzO4N/E---3.1_20851.p',m__2729) ).
fof(m__2666,hypothesis,
( aElement0(xq)
& aElement0(xr)
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& ( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dG8BWRzO4N/E---3.1_20851.p',m__2666) ).
fof(m__2673,hypothesis,
xr != sz00,
file('/export/starexec/sandbox2/tmp/tmp.dG8BWRzO4N/E---3.1_20851.p',m__2673) ).
fof(c_0_4,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_5,hypothesis,
! [X45,X46,X47] :
( aElementOf0(esk17_0,slsdtgt0(xa))
& aElementOf0(esk18_0,slsdtgt0(xb))
& sdtpldt0(esk17_0,esk18_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X46,slsdtgt0(xa))
| ~ aElementOf0(X47,slsdtgt0(xb))
| sdtpldt0(X46,X47) != X45
| X45 = sz00
| ~ iLess0(sbrdtbr0(X45),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X45,xI)
| X45 = sz00
| ~ iLess0(sbrdtbr0(X45),sbrdtbr0(xu)) ) ),
inference(distribute,[status(thm)],[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_6,hypothesis,
( aElementOf0(esk26_0,slsdtgt0(xa))
& aElementOf0(esk27_0,slsdtgt0(xb))
& sdtpldt0(esk26_0,esk27_0) = xr
& aElementOf0(xr,xI) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2729])]) ).
cnf(c_0_7,hypothesis,
( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_8,hypothesis,
xr != sz00,
inference(split_conjunct,[status(thm)],[m__2673]) ).
cnf(c_0_9,hypothesis,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : RNG124+4 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.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 19:42:38 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.dG8BWRzO4N/E---3.1_20851.p
% 0.17/0.49 # Version: 3.1pre001
% 0.17/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # sh5l with pid 20931 completed with status 8
% 0.17/0.49 # new_bool_3 with pid 20929 completed with status 0
% 0.17/0.49 # Result found by new_bool_3
% 0.17/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.17/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.17/0.49 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 20942 completed with status 0
% 0.17/0.49 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.17/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.17/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.17/0.49 # Preprocessing time : 0.003 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status ContradictoryAxioms
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 56
% 0.17/0.49 # Removed by relevancy pruning/SinE : 5
% 0.17/0.49 # Initial clauses : 197
% 0.17/0.49 # Removed in clause preprocessing : 5
% 0.17/0.49 # Initial clauses in saturation : 192
% 0.17/0.49 # Processed clauses : 326
% 0.17/0.49 # ...of these trivial : 1
% 0.17/0.49 # ...subsumed : 8
% 0.17/0.49 # ...remaining for further processing : 317
% 0.17/0.49 # Other redundant clauses eliminated : 2
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 2
% 0.17/0.49 # Backward-rewritten : 2
% 0.17/0.49 # Generated clauses : 315
% 0.17/0.49 # ...of the previous two non-redundant : 258
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 0
% 0.17/0.49 # Paramodulations : 306
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 9
% 0.17/0.49 # Total rewrite steps : 198
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 132
% 0.17/0.49 # Positive orientable unit clauses : 60
% 0.17/0.49 # Positive unorientable unit clauses: 0
% 0.17/0.49 # Negative unit clauses : 6
% 0.17/0.49 # Non-unit-clauses : 66
% 0.17/0.49 # Current number of unprocessed clauses: 304
% 0.17/0.49 # ...number of literals in the above : 793
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 185
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 2542
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 1078
% 0.17/0.49 # Non-unit clause-clause subsumptions : 5
% 0.17/0.49 # Unit Clause-clause subsumption calls : 13
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 2
% 0.17/0.49 # BW rewrite match successes : 2
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 14305
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.021 s
% 0.17/0.49 # System time : 0.008 s
% 0.17/0.49 # Total time : 0.029 s
% 0.17/0.49 # Maximum resident set size: 2252 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.027 s
% 0.17/0.49 # System time : 0.022 s
% 0.17/0.49 # Total time : 0.049 s
% 0.17/0.49 # Maximum resident set size: 1764 pages
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------