TSTP Solution File: CSR073+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR073+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:12 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 18 ~; 14 |; 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 : 35 ( 2 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query73,conjecture,
? [X1] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X1,c_pushingababycarriage) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query73) ).
fof(just59,axiom,
! [X15,X16] :
( ( mtvisible(X15)
& genlmt(X15,X16) )
=> mtvisible(X16) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just59) ).
fof(just18,axiom,
( mtvisible(c_tptp_member237_mt)
=> tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just18) ).
fof(just15,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just15) ).
fof(just13,axiom,
! [X1,X2] :
( tptptypes_9_401(X1,X2)
=> tptptypes_8_400(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just13) ).
fof(just11,axiom,
! [X1,X2] :
( tptptypes_8_400(X1,X2)
=> tptptypes_7_396(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just11) ).
fof(just7,axiom,
! [X1,X2] :
( tptptypes_6_388(X1,X2)
=> tptptypes_5_387(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just7) ).
fof(just9,axiom,
! [X1,X2] :
( tptptypes_7_396(X1,X2)
=> tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just9) ).
fof(c_0_8,negated_conjecture,
~ ? [X1] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X1,c_pushingababycarriage) ),
inference(assume_negation,[status(cth)],[query73]) ).
fof(c_0_9,plain,
! [X17,X18] :
( ~ mtvisible(X17)
| ~ genlmt(X17,X18)
| mtvisible(X18) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just59])]) ).
fof(c_0_10,negated_conjecture,
! [X2] :
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptptypes_5_387(X2,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])])])]) ).
fof(c_0_11,plain,
( ~ mtvisible(c_tptp_member237_mt)
| tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
inference(fof_nnf,[status(thm)],[just18]) ).
cnf(c_0_12,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
inference(split_conjunct,[status(thm)],[just15]) ).
cnf(c_0_14,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ tptptypes_9_401(X3,X4)
| tptptypes_8_400(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just13])]) ).
cnf(c_0_16,plain,
( tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)
| ~ mtvisible(c_tptp_member237_mt) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
mtvisible(c_tptp_member237_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ tptptypes_8_400(X3,X4)
| tptptypes_7_396(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])]) ).
cnf(c_0_19,plain,
( tptptypes_8_400(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ tptptypes_6_388(X3,X4)
| tptptypes_5_387(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just7])]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ tptptypes_7_396(X3,X4)
| tptptypes_6_388(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])]) ).
cnf(c_0_23,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage),
inference(spm,[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.11 % Problem : CSR073+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 10 15:55:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.015 s
% 0.22/1.40
% 0.22/1.40 # Failure: Out of unprocessed clauses!
% 0.22/1.40 # OLD status GaveUp
% 0.22/1.40 # Parsed axioms : 68
% 0.22/1.40 # Removed by relevancy pruning/SinE : 53
% 0.22/1.40 # Initial clauses : 16
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 16
% 0.22/1.40 # Processed clauses : 19
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 2
% 0.22/1.40 # ...remaining for further processing : 17
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 3
% 0.22/1.40 # ...of the previous two non-trivial : 3
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 3
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 17
% 0.22/1.40 # Positive orientable unit clauses : 1
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 14
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 11
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 11
% 0.22/1.40 # Non-unit clause-clause subsumptions : 2
% 0.22/1.40 # Unit Clause-clause subsumption calls : 3
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 1238
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.013 s
% 0.22/1.40 # System time : 0.003 s
% 0.22/1.40 # Total time : 0.016 s
% 0.22/1.40 # Maximum resident set size: 2784 pages
% 0.22/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 31
% 0.22/1.40 # Proof object clause steps : 15
% 0.22/1.40 # Proof object formula steps : 16
% 0.22/1.40 # Proof object conjectures : 6
% 0.22/1.40 # Proof object clause conjectures : 3
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 9
% 0.22/1.40 # Proof object initial formulas used : 8
% 0.22/1.40 # Proof object generating inferences : 5
% 0.22/1.40 # Proof object simplifying inferences : 5
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 68
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 69
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 69
% 0.22/1.40 # Processed clauses : 114
% 0.22/1.40 # ...of these trivial : 9
% 0.22/1.40 # ...subsumed : 10
% 0.22/1.40 # ...remaining for further processing : 95
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 1
% 0.22/1.40 # Generated clauses : 99
% 0.22/1.40 # ...of the previous two non-trivial : 79
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 99
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 94
% 0.22/1.40 # Positive orientable unit clauses : 47
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 45
% 0.22/1.40 # Current number of unprocessed clauses: 31
% 0.22/1.40 # ...number of literals in the above : 51
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 1
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 361
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 270
% 0.22/1.40 # Non-unit clause-clause subsumptions : 10
% 0.22/1.40 # Unit Clause-clause subsumption calls : 115
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 1
% 0.22/1.40 # BW rewrite match successes : 1
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 3923
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.015 s
% 0.22/1.40 # System time : 0.004 s
% 0.22/1.40 # Total time : 0.019 s
% 0.22/1.40 # Maximum resident set size: 3256 pages
%------------------------------------------------------------------------------