TSTP Solution File: RNG116+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG116+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Tue May 21 02:37:13 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 34 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 30 ( 9 ~; 5 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 2 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2456,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xk )
& aElementOf0(xk,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xl )
& aElementOf0(xl,slsdtgt0(xb))
& xu = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2456) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X161,X162] :
( ~ aElement0(X161)
| ~ aElement0(X162)
| xu != sdtpldt0(sdtasdt0(xa,X161),sdtasdt0(xb,X162)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,hypothesis,
( aElement0(esk39_0)
& sdtasdt0(xa,esk39_0) = xk
& aElementOf0(xk,slsdtgt0(xa))
& aElement0(esk40_0)
& sdtasdt0(xb,esk40_0) = xl
& aElementOf0(xl,slsdtgt0(xb))
& xu = sdtpldt0(xk,xl) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2456])]) ).
cnf(c_0_5,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(X2)
| xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
sdtasdt0(xb,esk40_0) = xl,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
aElement0(esk40_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
( sdtpldt0(sdtasdt0(xa,X1),xl) != xu
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_9,hypothesis,
sdtasdt0(xa,esk39_0) = xk,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,hypothesis,
xu = sdtpldt0(xk,xl),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,hypothesis,
aElement0(esk39_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG116+4 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 12:13:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/benchmark/theBenchmark.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 27260 completed with status 0
% 0.20/0.52 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.20/0.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 27268 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.20/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.20/0.52 # Preprocessing time : 0.004 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 48
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 196
% 0.20/0.52 # Removed in clause preprocessing : 4
% 0.20/0.52 # Initial clauses in saturation : 192
% 0.20/0.52 # Processed clauses : 275
% 0.20/0.52 # ...of these trivial : 1
% 0.20/0.52 # ...subsumed : 2
% 0.20/0.52 # ...remaining for further processing : 272
% 0.20/0.52 # Other redundant clauses eliminated : 22
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 43
% 0.20/0.52 # ...of the previous two non-redundant : 32
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 1
% 0.20/0.52 # Paramodulations : 23
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 22
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 27
% 0.20/0.52 # ...of those cached : 12
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 63
% 0.20/0.52 # Positive orientable unit clauses : 37
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 6
% 0.20/0.52 # Non-unit-clauses : 20
% 0.20/0.52 # Current number of unprocessed clauses: 138
% 0.20/0.52 # ...number of literals in the above : 511
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 189
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 3617
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1071
% 0.20/0.52 # Non-unit clause-clause subsumptions : 3
% 0.20/0.52 # Unit Clause-clause subsumption calls : 17
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 0
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 13196
% 0.20/0.52 # Search garbage collected termcells : 2659
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.027 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.032 s
% 0.20/0.52 # Maximum resident set size: 2292 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.102 s
% 0.20/0.52 # System time : 0.018 s
% 0.20/0.52 # Total time : 0.120 s
% 0.20/0.52 # Maximum resident set size: 1776 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------