TSTP Solution File: CSR073+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR073+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:02:13 EDT 2022
% Result : Theorem 0.28s 1.46s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 20 ~; 16 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 39 ( 2 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query123,conjecture,
? [X5] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X5,c_pushingababycarriage) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query123) ).
fof(ax1_409,axiom,
! [X5,X6] :
( tptptypes_7_396(X5,X6)
=> tptptypes_6_388(X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_409) ).
fof(ax1_174,axiom,
! [X5,X6] :
( tptptypes_8_400(X5,X6)
=> tptptypes_7_396(X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_174) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_1123) ).
fof(ax1_108,axiom,
! [X5,X6] :
( tptptypes_9_401(X5,X6)
=> tptptypes_8_400(X6,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_108) ).
fof(ax1_157,axiom,
( mtvisible(c_tptp_member237_mt)
=> tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_157) ).
fof(ax1_198,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_198) ).
fof(ax1_99,axiom,
! [X5,X6] :
( tptptypes_6_388(X5,X6)
=> tptptypes_5_387(X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_99) ).
fof(c_0_8,negated_conjecture,
~ ? [X5] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X5,c_pushingababycarriage) ),
inference(assume_negation,[status(cth)],[query123]) ).
fof(c_0_9,plain,
! [X7,X8] :
( ~ tptptypes_7_396(X7,X8)
| tptptypes_6_388(X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_409])]) ).
fof(c_0_10,plain,
! [X7,X8] :
( ~ tptptypes_8_400(X7,X8)
| tptptypes_7_396(X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_174])]) ).
fof(c_0_11,plain,
! [X22,X23] :
( ~ mtvisible(X22)
| ~ genlmt(X22,X23)
| mtvisible(X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])]) ).
fof(c_0_12,negated_conjecture,
! [X6] :
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptptypes_5_387(X6,c_pushingababycarriage) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_13,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X7,X8] :
( ~ tptptypes_9_401(X7,X8)
| tptptypes_8_400(X8,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_108])]) ).
fof(c_0_16,plain,
( ~ mtvisible(c_tptp_member237_mt)
| tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
inference(fof_nnf,[status(thm)],[ax1_157]) ).
cnf(c_0_17,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
inference(split_conjunct,[status(thm)],[ax1_198]) ).
cnf(c_0_19,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X7,X8] :
( ~ tptptypes_6_388(X7,X8)
| tptptypes_5_387(X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_99])]) ).
cnf(c_0_21,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
( tptptypes_8_400(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)
| ~ mtvisible(c_tptp_member237_mt) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
mtvisible(c_tptp_member237_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR073+2 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 11 14:03:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.28/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.46 # Preprocessing time : 0.034 s
% 0.28/1.46
% 0.28/1.46 # Failure: Out of unprocessed clauses!
% 0.28/1.46 # OLD status GaveUp
% 0.28/1.46 # Parsed axioms : 1132
% 0.28/1.46 # Removed by relevancy pruning/SinE : 1110
% 0.28/1.46 # Initial clauses : 23
% 0.28/1.46 # Removed in clause preprocessing : 0
% 0.28/1.46 # Initial clauses in saturation : 23
% 0.28/1.46 # Processed clauses : 35
% 0.28/1.46 # ...of these trivial : 0
% 0.28/1.46 # ...subsumed : 6
% 0.28/1.46 # ...remaining for further processing : 29
% 0.28/1.46 # Other redundant clauses eliminated : 0
% 0.28/1.46 # Clauses deleted for lack of memory : 0
% 0.28/1.46 # Backward-subsumed : 0
% 0.28/1.46 # Backward-rewritten : 0
% 0.28/1.46 # Generated clauses : 12
% 0.28/1.46 # ...of the previous two non-trivial : 12
% 0.28/1.46 # Contextual simplify-reflections : 0
% 0.28/1.46 # Paramodulations : 12
% 0.28/1.46 # Factorizations : 0
% 0.28/1.46 # Equation resolutions : 0
% 0.28/1.46 # Current number of processed clauses : 29
% 0.28/1.46 # Positive orientable unit clauses : 1
% 0.28/1.46 # Positive unorientable unit clauses: 0
% 0.28/1.46 # Negative unit clauses : 2
% 0.28/1.46 # Non-unit-clauses : 26
% 0.28/1.46 # Current number of unprocessed clauses: 0
% 0.28/1.46 # ...number of literals in the above : 0
% 0.28/1.46 # Current number of archived formulas : 0
% 0.28/1.46 # Current number of archived clauses : 0
% 0.28/1.46 # Clause-clause subsumption calls (NU) : 38
% 0.28/1.46 # Rec. Clause-clause subsumption calls : 24
% 0.28/1.46 # Non-unit clause-clause subsumptions : 6
% 0.28/1.46 # Unit Clause-clause subsumption calls : 0
% 0.28/1.46 # Rewrite failures with RHS unbound : 0
% 0.28/1.46 # BW rewrite match attempts : 0
% 0.28/1.46 # BW rewrite match successes : 0
% 0.28/1.46 # Condensation attempts : 0
% 0.28/1.46 # Condensation successes : 0
% 0.28/1.46 # Termbank termtop insertions : 8383
% 0.28/1.46
% 0.28/1.46 # -------------------------------------------------
% 0.28/1.46 # User time : 0.033 s
% 0.28/1.46 # System time : 0.002 s
% 0.28/1.46 # Total time : 0.035 s
% 0.28/1.46 # Maximum resident set size: 5160 pages
% 0.28/1.46 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.28/1.46 # Preprocessing time : 0.053 s
% 0.28/1.46
% 0.28/1.46 # Proof found!
% 0.28/1.46 # SZS status Theorem
% 0.28/1.46 # SZS output start CNFRefutation
% See solution above
% 0.28/1.46 # Proof object total steps : 31
% 0.28/1.46 # Proof object clause steps : 15
% 0.28/1.46 # Proof object formula steps : 16
% 0.28/1.46 # Proof object conjectures : 6
% 0.28/1.46 # Proof object clause conjectures : 3
% 0.28/1.46 # Proof object formula conjectures : 3
% 0.28/1.46 # Proof object initial clauses used : 9
% 0.28/1.46 # Proof object initial formulas used : 8
% 0.28/1.46 # Proof object generating inferences : 5
% 0.28/1.46 # Proof object simplifying inferences : 5
% 0.28/1.46 # Training examples: 0 positive, 0 negative
% 0.28/1.46 # Parsed axioms : 1132
% 0.28/1.46 # Removed by relevancy pruning/SinE : 0
% 0.28/1.46 # Initial clauses : 1133
% 0.28/1.46 # Removed in clause preprocessing : 0
% 0.28/1.46 # Initial clauses in saturation : 1133
% 0.28/1.46 # Processed clauses : 1948
% 0.28/1.46 # ...of these trivial : 162
% 0.28/1.46 # ...subsumed : 52
% 0.28/1.46 # ...remaining for further processing : 1734
% 0.28/1.46 # Other redundant clauses eliminated : 0
% 0.28/1.46 # Clauses deleted for lack of memory : 0
% 0.28/1.46 # Backward-subsumed : 1
% 0.28/1.46 # Backward-rewritten : 58
% 0.28/1.46 # Generated clauses : 3836
% 0.28/1.46 # ...of the previous two non-trivial : 3627
% 0.28/1.46 # Contextual simplify-reflections : 0
% 0.28/1.46 # Paramodulations : 3836
% 0.28/1.46 # Factorizations : 0
% 0.28/1.46 # Equation resolutions : 0
% 0.28/1.46 # Current number of processed clauses : 1675
% 0.28/1.46 # Positive orientable unit clauses : 624
% 0.28/1.46 # Positive unorientable unit clauses: 0
% 0.28/1.46 # Negative unit clauses : 196
% 0.28/1.46 # Non-unit-clauses : 855
% 0.28/1.46 # Current number of unprocessed clauses: 2753
% 0.28/1.46 # ...number of literals in the above : 4370
% 0.28/1.46 # Current number of archived formulas : 0
% 0.28/1.46 # Current number of archived clauses : 59
% 0.28/1.46 # Clause-clause subsumption calls (NU) : 127573
% 0.28/1.46 # Rec. Clause-clause subsumption calls : 116431
% 0.28/1.46 # Non-unit clause-clause subsumptions : 53
% 0.28/1.46 # Unit Clause-clause subsumption calls : 142638
% 0.28/1.46 # Rewrite failures with RHS unbound : 0
% 0.28/1.46 # BW rewrite match attempts : 23
% 0.28/1.46 # BW rewrite match successes : 20
% 0.28/1.46 # Condensation attempts : 0
% 0.28/1.46 # Condensation successes : 0
% 0.28/1.46 # Termbank termtop insertions : 73223
% 0.28/1.46
% 0.28/1.46 # -------------------------------------------------
% 0.28/1.46 # User time : 0.162 s
% 0.28/1.46 # System time : 0.009 s
% 0.28/1.46 # Total time : 0.171 s
% 0.28/1.46 # Maximum resident set size: 12724 pages
%------------------------------------------------------------------------------