TSTP Solution File: CSR085+6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR085+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : Mon May 20 19:18:18 EDT 2024
% Result : Theorem 3.05s 2.06s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 7 ~; 4 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
s__instance(s__Organism12_1,s__Organism),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(local_3,axiom,
! [X2341] :
( s__instance(X2341,s__Object)
=> ( s__attribute(X2341,s__Living)
=> s__instance(X2341,s__Organism) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(local_2,axiom,
s__attribute(s__Organism12_1,s__Living),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(local_1,axiom,
s__instance(s__Organism12_1,s__Object),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_4,negated_conjecture,
~ s__instance(s__Organism12_1,s__Organism),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
fof(c_0_5,plain,
! [X2356] :
( ~ s__instance(X2356,s__Object)
| ~ s__attribute(X2356,s__Living)
| s__instance(X2356,s__Organism) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[local_3])])]) ).
fof(c_0_6,negated_conjecture,
~ s__instance(s__Organism12_1,s__Organism),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( s__instance(X1,s__Organism)
| ~ s__instance(X1,s__Object)
| ~ s__attribute(X1,s__Living) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
s__attribute(s__Organism12_1,s__Living),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_9,plain,
s__instance(s__Organism12_1,s__Object),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_10,negated_conjecture,
~ s__instance(s__Organism12_1,s__Organism),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR085+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 00:46:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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
% 3.05/2.06 # Version: 3.1.0
% 3.05/2.06 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.05/2.06 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.05/2.06 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.05/2.06 # Starting new_bool_3 with 299s (1) cores
% 3.05/2.06 # Starting new_bool_1 with 299s (1) cores
% 3.05/2.06 # Starting sh5l with 299s (1) cores
% 3.05/2.06 # new_bool_1 with pid 3494 completed with status 0
% 3.05/2.06 # Result found by new_bool_1
% 3.05/2.06 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.05/2.06 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.05/2.06 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.05/2.06 # Starting new_bool_3 with 299s (1) cores
% 3.05/2.06 # Starting new_bool_1 with 299s (1) cores
% 3.05/2.06 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.05/2.06 # Search class: FHHSF-FFMM21-SFFFFFNN
% 3.05/2.06 # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 3.05/2.06 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 3.05/2.06 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 162s (1) cores
% 3.05/2.06 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 3504 completed with status 0
% 3.05/2.06 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 3.05/2.06 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.05/2.06 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.05/2.06 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.05/2.06 # Starting new_bool_3 with 299s (1) cores
% 3.05/2.06 # Starting new_bool_1 with 299s (1) cores
% 3.05/2.06 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.05/2.06 # Search class: FHHSF-FFMM21-SFFFFFNN
% 3.05/2.06 # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 3.05/2.06 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 3.05/2.06 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 162s (1) cores
% 3.05/2.06 # Preprocessing time : 0.053 s
% 3.05/2.06 # Presaturation interreduction done
% 3.05/2.06
% 3.05/2.06 # Proof found!
% 3.05/2.06 # SZS status Theorem
% 3.05/2.06 # SZS output start CNFRefutation
% See solution above
% 3.05/2.06 # Parsed axioms : 55590
% 3.05/2.06 # Removed by relevancy pruning/SinE : 55557
% 3.05/2.06 # Initial clauses : 42
% 3.05/2.06 # Removed in clause preprocessing : 4
% 3.05/2.06 # Initial clauses in saturation : 38
% 3.05/2.06 # Processed clauses : 67
% 3.05/2.06 # ...of these trivial : 1
% 3.05/2.06 # ...subsumed : 0
% 3.05/2.06 # ...remaining for further processing : 66
% 3.05/2.06 # Other redundant clauses eliminated : 0
% 3.05/2.06 # Clauses deleted for lack of memory : 0
% 3.05/2.06 # Backward-subsumed : 0
% 3.05/2.06 # Backward-rewritten : 0
% 3.05/2.06 # Generated clauses : 26
% 3.05/2.06 # ...of the previous two non-redundant : 21
% 3.05/2.06 # ...aggressively subsumed : 0
% 3.05/2.06 # Contextual simplify-reflections : 7
% 3.05/2.06 # Paramodulations : 26
% 3.05/2.06 # Factorizations : 0
% 3.05/2.06 # NegExts : 0
% 3.05/2.06 # Equation resolutions : 0
% 3.05/2.06 # Disequality decompositions : 0
% 3.05/2.06 # Total rewrite steps : 6
% 3.05/2.06 # ...of those cached : 2
% 3.05/2.06 # Propositional unsat checks : 0
% 3.05/2.06 # Propositional check models : 0
% 3.05/2.06 # Propositional check unsatisfiable : 0
% 3.05/2.06 # Propositional clauses : 0
% 3.05/2.06 # Propositional clauses after purity: 0
% 3.05/2.06 # Propositional unsat core size : 0
% 3.05/2.06 # Propositional preprocessing time : 0.000
% 3.05/2.06 # Propositional encoding time : 0.000
% 3.05/2.06 # Propositional solver time : 0.000
% 3.05/2.06 # Success case prop preproc time : 0.000
% 3.05/2.06 # Success case prop encoding time : 0.000
% 3.05/2.06 # Success case prop solver time : 0.000
% 3.05/2.06 # Current number of processed clauses : 28
% 3.05/2.06 # Positive orientable unit clauses : 21
% 3.05/2.06 # Positive unorientable unit clauses: 0
% 3.05/2.06 # Negative unit clauses : 1
% 3.05/2.06 # Non-unit-clauses : 6
% 3.05/2.06 # Current number of unprocessed clauses: 30
% 3.05/2.06 # ...number of literals in the above : 85
% 3.05/2.06 # Current number of archived formulas : 0
% 3.05/2.06 # Current number of archived clauses : 38
% 3.05/2.06 # Clause-clause subsumption calls (NU) : 164
% 3.05/2.06 # Rec. Clause-clause subsumption calls : 42
% 3.05/2.06 # Non-unit clause-clause subsumptions : 7
% 3.05/2.06 # Unit Clause-clause subsumption calls : 6
% 3.05/2.06 # Rewrite failures with RHS unbound : 0
% 3.05/2.06 # BW rewrite match attempts : 0
% 3.05/2.06 # BW rewrite match successes : 0
% 3.05/2.06 # Condensation attempts : 0
% 3.05/2.06 # Condensation successes : 0
% 3.05/2.06 # Termbank termtop insertions : 651086
% 3.05/2.06 # Search garbage collected termcells : 291241
% 3.05/2.06
% 3.05/2.06 # -------------------------------------------------
% 3.05/2.06 # User time : 0.254 s
% 3.05/2.06 # System time : 0.152 s
% 3.05/2.06 # Total time : 0.405 s
% 3.05/2.06 # Maximum resident set size: 131708 pages
% 3.05/2.06
% 3.05/2.06 # -------------------------------------------------
% 3.05/2.06 # User time : 1.301 s
% 3.05/2.06 # System time : 0.206 s
% 3.05/2.06 # Total time : 1.507 s
% 3.05/2.06 # Maximum resident set size: 57424 pages
% 3.05/2.06 % E---3.1 exiting
%------------------------------------------------------------------------------