TSTP Solution File: CSR045+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR045+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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 0.84s 3.03s
% Output : CNFRefutation 0.84s
% 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(ax2_938,axiom,
! [X1] :
( informationstore(X1)
=> partiallyintangibleindividual(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_938) ).
fof(ax2_288,axiom,
! [X1] :
( aspatialinformationstore(X1)
=> informationstore(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_288) ).
fof(query145,conjecture,
~ genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query145) ).
fof(ax2_3129,axiom,
! [X1] :
( partiallyintangibleindividual(X1)
=> individual(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3129) ).
fof(ax2_529,axiom,
! [X3,X4] :
( genls(X3,X4)
=> collection(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_529) ).
fof(ax2_3192,axiom,
! [X1] :
( microtheory(X1)
=> aspatialinformationstore(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3192) ).
fof(ax2_1265,axiom,
! [X1] :
( applicationcontext(X1)
=> microtheory(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1265) ).
fof(ax2_3089,axiom,
! [X1] :
~ ( collection(X1)
& individual(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3089) ).
fof(ax2_1253,axiom,
applicationcontext(c_wamt_evalinitial_p14),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1253) ).
fof(c_0_9,plain,
! [X2] :
( ~ informationstore(X2)
| partiallyintangibleindividual(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_938])]) ).
fof(c_0_10,plain,
! [X2] :
( ~ aspatialinformationstore(X2)
| informationstore(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_288])]) ).
fof(c_0_11,negated_conjecture,
~ ~ genls(c_wamt_evalinitial_p14,c_tptpcol_15_80088),
inference(assume_negation,[status(cth)],[query145]) ).
fof(c_0_12,plain,
! [X2] :
( ~ partiallyintangibleindividual(X2)
| individual(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3129])]) ).
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,
! [X5,X6] :
( ~ genls(X5,X6)
| collection(X5) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_529])])])]) ).
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)],[ax2_3192])]) ).
fof(c_0_20,plain,
! [X2] :
( ~ applicationcontext(X2)
| microtheory(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1265])]) ).
fof(c_0_21,plain,
! [X2] :
( ~ collection(X2)
| ~ individual(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3089])]) ).
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)],[ax2_1253]) ).
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.13 % Problem : CSR045+3 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 05:23:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.84/3.03 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.84/3.03 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.84/3.03 # Preprocessing time : 0.157 s
% 0.84/3.03
% 0.84/3.03 # Failure: Out of unprocessed clauses!
% 0.84/3.03 # OLD status GaveUp
% 0.84/3.03 # Parsed axioms : 8006
% 0.84/3.03 # Removed by relevancy pruning/SinE : 7986
% 0.84/3.03 # Initial clauses : 20
% 0.84/3.03 # Removed in clause preprocessing : 0
% 0.84/3.03 # Initial clauses in saturation : 20
% 0.84/3.03 # Processed clauses : 23
% 0.84/3.03 # ...of these trivial : 1
% 0.84/3.03 # ...subsumed : 6
% 0.84/3.03 # ...remaining for further processing : 16
% 0.84/3.03 # Other redundant clauses eliminated : 0
% 0.84/3.03 # Clauses deleted for lack of memory : 0
% 0.84/3.03 # Backward-subsumed : 0
% 0.84/3.03 # Backward-rewritten : 0
% 0.84/3.03 # Generated clauses : 6
% 0.84/3.03 # ...of the previous two non-trivial : 3
% 0.84/3.03 # Contextual simplify-reflections : 0
% 0.84/3.03 # Paramodulations : 6
% 0.84/3.03 # Factorizations : 0
% 0.84/3.03 # Equation resolutions : 0
% 0.84/3.03 # Current number of processed clauses : 16
% 0.84/3.03 # Positive orientable unit clauses : 7
% 0.84/3.03 # Positive unorientable unit clauses: 0
% 0.84/3.03 # Negative unit clauses : 0
% 0.84/3.03 # Non-unit-clauses : 9
% 0.84/3.03 # Current number of unprocessed clauses: 0
% 0.84/3.03 # ...number of literals in the above : 0
% 0.84/3.03 # Current number of archived formulas : 0
% 0.84/3.03 # Current number of archived clauses : 0
% 0.84/3.03 # Clause-clause subsumption calls (NU) : 8
% 0.84/3.03 # Rec. Clause-clause subsumption calls : 8
% 0.84/3.03 # Non-unit clause-clause subsumptions : 6
% 0.84/3.03 # Unit Clause-clause subsumption calls : 0
% 0.84/3.03 # Rewrite failures with RHS unbound : 0
% 0.84/3.03 # BW rewrite match attempts : 0
% 0.84/3.03 # BW rewrite match successes : 0
% 0.84/3.03 # Condensation attempts : 0
% 0.84/3.03 # Condensation successes : 0
% 0.84/3.03 # Termbank termtop insertions : 51744
% 0.84/3.03
% 0.84/3.03 # -------------------------------------------------
% 0.84/3.03 # User time : 0.139 s
% 0.84/3.03 # System time : 0.019 s
% 0.84/3.03 # Total time : 0.158 s
% 0.84/3.03 # Maximum resident set size: 19680 pages
% 0.84/3.03 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.84/3.03 # Preprocessing time : 0.229 s
% 0.84/3.03
% 0.84/3.03 # Proof found!
% 0.84/3.03 # SZS status Theorem
% 0.84/3.03 # SZS output start CNFRefutation
% See solution above
% 0.84/3.03 # Proof object total steps : 34
% 0.84/3.03 # Proof object clause steps : 16
% 0.84/3.03 # Proof object formula steps : 18
% 0.84/3.03 # Proof object conjectures : 6
% 0.84/3.03 # Proof object clause conjectures : 3
% 0.84/3.03 # Proof object formula conjectures : 3
% 0.84/3.03 # Proof object initial clauses used : 9
% 0.84/3.03 # Proof object initial formulas used : 9
% 0.84/3.03 # Proof object generating inferences : 7
% 0.84/3.03 # Proof object simplifying inferences : 1
% 0.84/3.03 # Training examples: 0 positive, 0 negative
% 0.84/3.03 # Parsed axioms : 8006
% 0.84/3.03 # Removed by relevancy pruning/SinE : 0
% 0.84/3.03 # Initial clauses : 8006
% 0.84/3.03 # Removed in clause preprocessing : 0
% 0.84/3.03 # Initial clauses in saturation : 8006
% 0.84/3.03 # Processed clauses : 9384
% 0.84/3.03 # ...of these trivial : 1036
% 0.84/3.03 # ...subsumed : 362
% 0.84/3.03 # ...remaining for further processing : 7986
% 0.84/3.03 # Other redundant clauses eliminated : 0
% 0.84/3.03 # Clauses deleted for lack of memory : 0
% 0.84/3.03 # Backward-subsumed : 1
% 0.84/3.03 # Backward-rewritten : 29
% 0.84/3.03 # Generated clauses : 25719
% 0.84/3.03 # ...of the previous two non-trivial : 23902
% 0.84/3.03 # Contextual simplify-reflections : 20
% 0.84/3.03 # Paramodulations : 25719
% 0.84/3.03 # Factorizations : 0
% 0.84/3.03 # Equation resolutions : 0
% 0.84/3.03 # Current number of processed clauses : 7956
% 0.84/3.03 # Positive orientable unit clauses : 3140
% 0.84/3.03 # Positive unorientable unit clauses: 0
% 0.84/3.03 # Negative unit clauses : 95
% 0.84/3.03 # Non-unit-clauses : 4721
% 0.84/3.03 # Current number of unprocessed clauses: 22502
% 0.84/3.03 # ...number of literals in the above : 42638
% 0.84/3.03 # Current number of archived formulas : 0
% 0.84/3.03 # Current number of archived clauses : 30
% 0.84/3.03 # Clause-clause subsumption calls (NU) : 2781908
% 0.84/3.03 # Rec. Clause-clause subsumption calls : 2597315
% 0.84/3.03 # Non-unit clause-clause subsumptions : 383
% 0.84/3.03 # Unit Clause-clause subsumption calls : 223994
% 0.84/3.03 # Rewrite failures with RHS unbound : 0
% 0.84/3.03 # BW rewrite match attempts : 2576
% 0.84/3.03 # BW rewrite match successes : 29
% 0.84/3.03 # Condensation attempts : 0
% 0.84/3.03 # Condensation successes : 0
% 0.84/3.03 # Termbank termtop insertions : 510602
% 0.84/3.03
% 0.84/3.03 # -------------------------------------------------
% 0.84/3.03 # User time : 0.951 s
% 0.84/3.03 # System time : 0.040 s
% 0.84/3.03 # Total time : 0.991 s
% 0.84/3.03 # Maximum resident set size: 69992 pages
%------------------------------------------------------------------------------