TSTP Solution File: CSR045+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR045+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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 : 600s
% DateTime : Fri Jul 15 03:01:46 EDT 2022
% Result : Theorem 13.49s 27.68s
% Output : CNFRefutation 13.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 48 ( 24 ~; 17 |; 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 : 27 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax3_26203,axiom,
! [X1] :
( informationstore(X1)
=> partiallyintangibleindividual(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_26203) ).
fof(ax3_16898,axiom,
! [X1] :
( aspatialinformationstore(X1)
=> informationstore(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_16898) ).
fof(query195,conjecture,
~ genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query195) ).
fof(ax3_10185,axiom,
! [X1] :
( partiallyintangibleindividual(X1)
=> individual(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_10185) ).
fof(ax3_19537,axiom,
! [X2,X3] :
( genls(X2,X3)
=> collection(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_19537) ).
fof(ax3_5173,axiom,
! [X1] :
( microtheory(X1)
=> aspatialinformationstore(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_5173) ).
fof(ax3_567,axiom,
! [X1] :
( applicationcontext(X1)
=> microtheory(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_567) ).
fof(ax3_4028,axiom,
! [X1] :
~ ( collection(X1)
& individual(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_4028) ).
fof(ax3_6724,axiom,
applicationcontext(c_wamt_evalinitial_p14),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_6724) ).
fof(c_0_9,plain,
! [X2] :
( ~ informationstore(X2)
| partiallyintangibleindividual(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_26203])]) ).
fof(c_0_10,plain,
! [X2] :
( ~ aspatialinformationstore(X2)
| informationstore(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_16898])]) ).
fof(c_0_11,negated_conjecture,
~ ~ genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
inference(assume_negation,[status(cth)],[query195]) ).
fof(c_0_12,plain,
! [X2] :
( ~ partiallyintangibleindividual(X2)
| individual(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_10185])]) ).
cnf(c_0_13,plain,
( partiallyintangibleindividual(X1)
| ~ informationstore(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( informationstore(X1)
| ~ aspatialinformationstore(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X4,X5] :
( ~ genls(X4,X5)
| collection(X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_19537])])])]) ).
fof(c_0_16,negated_conjecture,
genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( individual(X1)
| ~ partiallyintangibleindividual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( partiallyintangibleindividual(X1)
| ~ aspatialinformationstore(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X2] :
( ~ microtheory(X2)
| aspatialinformationstore(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_5173])]) ).
fof(c_0_20,plain,
! [X2] :
( ~ applicationcontext(X2)
| microtheory(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_567])]) ).
fof(c_0_21,plain,
! [X2] :
( ~ collection(X2)
| ~ individual(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_4028])]) ).
cnf(c_0_22,plain,
( collection(X1)
| ~ genls(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( individual(X1)
| ~ aspatialinformationstore(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( aspatialinformationstore(X1)
| ~ microtheory(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( microtheory(X1)
| ~ applicationcontext(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
applicationcontext(c_wamt_evalinitial_p14),
inference(split_conjunct,[status(thm)],[ax3_6724]) ).
cnf(c_0_28,plain,
( ~ individual(X1)
| ~ collection(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
collection(c_wamt_evalinitial_p14),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( individual(X1)
| ~ microtheory(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
microtheory(c_wamt_evalinitial_p14),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ individual(c_wamt_evalinitial_p14),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR045+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 00:49:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 13.49/27.68 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 13.49/27.68 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 13.49/27.68 # Preprocessing time : 0.691 s
% 13.49/27.68
% 13.49/27.68 # Failure: Out of unprocessed clauses!
% 13.49/27.68 # OLD status GaveUp
% 13.49/27.68 # Parsed axioms : 44217
% 13.49/27.68 # Removed by relevancy pruning/SinE : 44194
% 13.49/27.68 # Initial clauses : 23
% 13.49/27.68 # Removed in clause preprocessing : 0
% 13.49/27.68 # Initial clauses in saturation : 23
% 13.49/27.68 # Processed clauses : 29
% 13.49/27.68 # ...of these trivial : 2
% 13.49/27.68 # ...subsumed : 7
% 13.49/27.68 # ...remaining for further processing : 20
% 13.49/27.68 # Other redundant clauses eliminated : 0
% 13.49/27.68 # Clauses deleted for lack of memory : 0
% 13.49/27.68 # Backward-subsumed : 0
% 13.49/27.68 # Backward-rewritten : 0
% 13.49/27.68 # Generated clauses : 11
% 13.49/27.68 # ...of the previous two non-trivial : 6
% 13.49/27.68 # Contextual simplify-reflections : 0
% 13.49/27.68 # Paramodulations : 11
% 13.49/27.68 # Factorizations : 0
% 13.49/27.68 # Equation resolutions : 0
% 13.49/27.68 # Current number of processed clauses : 20
% 13.49/27.68 # Positive orientable unit clauses : 7
% 13.49/27.68 # Positive unorientable unit clauses: 0
% 13.49/27.68 # Negative unit clauses : 0
% 13.49/27.68 # Non-unit-clauses : 13
% 13.49/27.68 # Current number of unprocessed clauses: 0
% 13.49/27.68 # ...number of literals in the above : 0
% 13.49/27.68 # Current number of archived formulas : 0
% 13.49/27.68 # Current number of archived clauses : 0
% 13.49/27.68 # Clause-clause subsumption calls (NU) : 35
% 13.49/27.68 # Rec. Clause-clause subsumption calls : 32
% 13.49/27.68 # Non-unit clause-clause subsumptions : 7
% 13.49/27.68 # Unit Clause-clause subsumption calls : 0
% 13.49/27.68 # Rewrite failures with RHS unbound : 0
% 13.49/27.68 # BW rewrite match attempts : 0
% 13.49/27.68 # BW rewrite match successes : 0
% 13.49/27.68 # Condensation attempts : 0
% 13.49/27.68 # Condensation successes : 0
% 13.49/27.68 # Termbank termtop insertions : 292734
% 13.49/27.68
% 13.49/27.68 # -------------------------------------------------
% 13.49/27.68 # User time : 0.625 s
% 13.49/27.68 # System time : 0.066 s
% 13.49/27.68 # Total time : 0.691 s
% 13.49/27.68 # Maximum resident set size: 86376 pages
% 13.49/27.68 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 13.49/27.68 # Preprocessing time : 1.467 s
% 13.49/27.68
% 13.49/27.68 # Proof found!
% 13.49/27.68 # SZS status Theorem
% 13.49/27.68 # SZS output start CNFRefutation
% See solution above
% 13.49/27.68 # Proof object total steps : 34
% 13.49/27.68 # Proof object clause steps : 16
% 13.49/27.68 # Proof object formula steps : 18
% 13.49/27.68 # Proof object conjectures : 6
% 13.49/27.68 # Proof object clause conjectures : 3
% 13.49/27.68 # Proof object formula conjectures : 3
% 13.49/27.68 # Proof object initial clauses used : 9
% 13.49/27.68 # Proof object initial formulas used : 9
% 13.49/27.68 # Proof object generating inferences : 7
% 13.49/27.68 # Proof object simplifying inferences : 1
% 13.49/27.68 # Training examples: 0 positive, 0 negative
% 13.49/27.68 # Parsed axioms : 44217
% 13.49/27.68 # Removed by relevancy pruning/SinE : 0
% 13.49/27.68 # Initial clauses : 44217
% 13.49/27.68 # Removed in clause preprocessing : 3
% 13.49/27.68 # Initial clauses in saturation : 44214
% 13.49/27.68 # Processed clauses : 46652
% 13.49/27.68 # ...of these trivial : 2339
% 13.49/27.68 # ...subsumed : 915
% 13.49/27.68 # ...remaining for further processing : 43398
% 13.49/27.68 # Other redundant clauses eliminated : 2
% 13.49/27.68 # Clauses deleted for lack of memory : 203510
% 13.49/27.68 # Backward-subsumed : 1
% 13.49/27.68 # Backward-rewritten : 699
% 13.49/27.68 # Generated clauses : 257306
% 13.49/27.68 # ...of the previous two non-trivial : 238642
% 13.49/27.68 # Contextual simplify-reflections : 180
% 13.49/27.68 # Paramodulations : 257304
% 13.49/27.68 # Factorizations : 0
% 13.49/27.68 # Equation resolutions : 2
% 13.49/27.68 # Current number of processed clauses : 42696
% 13.49/27.68 # Positive orientable unit clauses : 23038
% 13.49/27.68 # Positive unorientable unit clauses: 0
% 13.49/27.68 # Negative unit clauses : 247
% 13.49/27.68 # Non-unit-clauses : 19411
% 13.49/27.68 # Current number of unprocessed clauses: 32031
% 13.49/27.68 # ...number of literals in the above : 45037
% 13.49/27.68 # Current number of archived formulas : 0
% 13.49/27.68 # Current number of archived clauses : 700
% 13.49/27.68 # Clause-clause subsumption calls (NU) : 37786217
% 13.49/27.68 # Rec. Clause-clause subsumption calls : 34246242
% 13.49/27.68 # Non-unit clause-clause subsumptions : 1095
% 13.49/27.68 # Unit Clause-clause subsumption calls : 2499668
% 13.49/27.68 # Rewrite failures with RHS unbound : 0
% 13.49/27.68 # BW rewrite match attempts : 1638248
% 13.49/27.68 # BW rewrite match successes : 86
% 13.49/27.68 # Condensation attempts : 0
% 13.49/27.68 # Condensation successes : 0
% 13.49/27.68 # Termbank termtop insertions : 3847666
% 13.49/27.68
% 13.49/27.68 # -------------------------------------------------
% 13.49/27.68 # User time : 12.181 s
% 13.49/27.68 # System time : 0.235 s
% 13.49/27.68 # Total time : 12.416 s
% 13.49/27.68 # Maximum resident set size: 351124 pages
%------------------------------------------------------------------------------