TSTP Solution File: CSR045+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR045+1 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:13:34 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 51 ( 26 ~; 18 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 28 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(just15,axiom,
! [X1] :
~ ( collection(X1)
& individual(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just15) ).
fof(just10,axiom,
! [X1] :
( partiallyintangibleindividual(X1)
=> individual(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just10) ).
fof(just6,axiom,
! [X1] :
( intangibleindividual(X1)
=> partiallyintangibleindividual(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just6) ).
fof(just8,axiom,
! [X1] :
( aspatialinformationstore(X1)
=> intangibleindividual(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just8) ).
fof(just3,axiom,
! [X1] :
( microtheory(X1)
=> aspatialinformationstore(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just3) ).
fof(just14,axiom,
! [X1] :
( applicationcontext(X1)
=> microtheory(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just14) ).
fof(just1,axiom,
applicationcontext(c_wamt_evalinitial_p14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
fof(just20,axiom,
! [X7,X8] :
( genls(X7,X8)
=> collection(X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just20) ).
fof(query45,conjecture,
~ genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query45) ).
fof(c_0_9,plain,
! [X53] :
( ~ collection(X53)
| ~ individual(X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just15])])]) ).
fof(c_0_10,plain,
! [X79] :
( ~ partiallyintangibleindividual(X79)
| individual(X79) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just10])])]) ).
fof(c_0_11,plain,
! [X95] :
( ~ intangibleindividual(X95)
| partiallyintangibleindividual(X95) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just6])])]) ).
fof(c_0_12,plain,
! [X98] :
( ~ aspatialinformationstore(X98)
| intangibleindividual(X98) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just8])])]) ).
cnf(c_0_13,plain,
( ~ collection(X1)
| ~ individual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( individual(X1)
| ~ partiallyintangibleindividual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( partiallyintangibleindividual(X1)
| ~ intangibleindividual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( intangibleindividual(X1)
| ~ aspatialinformationstore(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ collection(X1)
| ~ partiallyintangibleindividual(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( partiallyintangibleindividual(X1)
| ~ aspatialinformationstore(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X82] :
( ~ microtheory(X82)
| aspatialinformationstore(X82) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just3])])]) ).
fof(c_0_20,plain,
! [X76] :
( ~ applicationcontext(X76)
| microtheory(X76) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just14])])]) ).
cnf(c_0_21,plain,
( ~ collection(X1)
| ~ aspatialinformationstore(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( aspatialinformationstore(X1)
| ~ microtheory(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( microtheory(X1)
| ~ applicationcontext(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
applicationcontext(c_wamt_evalinitial_p14),
inference(split_conjunct,[status(thm)],[just1]) ).
fof(c_0_25,plain,
! [X17,X18] :
( ~ genls(X17,X18)
| collection(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just20])])]) ).
fof(c_0_26,negated_conjecture,
genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query45])]) ).
cnf(c_0_27,plain,
( ~ collection(X1)
| ~ microtheory(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
microtheory(c_wamt_evalinitial_p14),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( collection(X1)
| ~ genls(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
~ collection(c_wamt_evalinitial_p14),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR045+1 : TPTP v8.2.0. Released v3.4.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.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 01:11:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # sh5l with pid 12371 completed with status 0
% 0.21/0.51 # Result found by sh5l
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FHHNF-FFMM00-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 12375 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FHHNF-FFMM00-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 85
% 0.21/0.51 # Removed by relevancy pruning/SinE : 25
% 0.21/0.51 # Initial clauses : 60
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 60
% 0.21/0.51 # Processed clauses : 144
% 0.21/0.51 # ...of these trivial : 1
% 0.21/0.51 # ...subsumed : 17
% 0.21/0.51 # ...remaining for further processing : 126
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 80
% 0.21/0.51 # ...of the previous two non-redundant : 68
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 80
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 6
% 0.21/0.51 # ...of those cached : 4
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 78
% 0.21/0.51 # Positive orientable unit clauses : 23
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 18
% 0.21/0.51 # Non-unit-clauses : 37
% 0.21/0.52 # Current number of unprocessed clauses: 28
% 0.21/0.52 # ...number of literals in the above : 55
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 48
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 348
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 331
% 0.21/0.52 # Non-unit clause-clause subsumptions : 12
% 0.21/0.52 # Unit Clause-clause subsumption calls : 228
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 4183
% 0.21/0.52 # Search garbage collected termcells : 693
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.001 s
% 0.21/0.52 # Total time : 0.012 s
% 0.21/0.52 # Maximum resident set size: 1908 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.013 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.017 s
% 0.21/0.52 # Maximum resident set size: 1776 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------