TSTP Solution File: CSR062+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR062+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:01 EDT 2022
% Result : Theorem 0.15s 1.35s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 16 ~; 12 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 29 ( 2 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query62,conjecture,
? [X1] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X1,c_pushingwithfingers) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query62) ).
fof(just53,axiom,
! [X15,X16] :
( ( mtvisible(X15)
& genlmt(X15,X16) )
=> mtvisible(X16) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just53) ).
fof(just13,axiom,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just13) ).
fof(just14,axiom,
( mtvisible(c_cyclistsmt)
=> tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just14) ).
fof(just12,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just12) ).
fof(just11,axiom,
! [X1,X2] :
( tptptypes_8_390(X1,X2)
=> tptptypes_7_389(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_389(X1,X2)
=> tptptypes_6_388(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just9) ).
fof(c_0_8,negated_conjecture,
~ ? [X1] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X1,c_pushingwithfingers) ),
inference(assume_negation,[status(cth)],[query62]) ).
fof(c_0_9,plain,
! [X17,X18] :
( ~ mtvisible(X17)
| ~ genlmt(X17,X18)
| mtvisible(X18) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just53])]) ).
fof(c_0_10,negated_conjecture,
! [X2] :
( mtvisible(c_tptp_member3205_mt)
& ~ tptptypes_5_387(X2,c_pushingwithfingers) ),
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_11,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[just13]) ).
cnf(c_0_13,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
( ~ mtvisible(c_cyclistsmt)
| tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
inference(fof_nnf,[status(thm)],[just14]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[just12]) ).
cnf(c_0_16,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ tptptypes_8_390(X3,X4)
| tptptypes_7_389(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])]) ).
cnf(c_0_18,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_16])]) ).
fof(c_0_20,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_21,plain,
! [X3,X4] :
( ~ tptptypes_7_389(X3,X4)
| tptptypes_6_388(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])]) ).
cnf(c_0_22,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_24,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
tptptypes_7_389(c_pushingwithfingers,c_tptpcol_15_4027),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : CSR062+1 : TPTP v8.1.0. Released v3.4.0.
% 0.05/0.10 % Command : run_ET %s %d
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Thu Jun 9 17:49:53 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.15/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.15/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.15/1.35 # Preprocessing time : 0.009 s
% 0.15/1.35
% 0.15/1.35 # Proof found!
% 0.15/1.35 # SZS status Theorem
% 0.15/1.35 # SZS output start CNFRefutation
% See solution above
% 0.15/1.35 # Proof object total steps : 30
% 0.15/1.35 # Proof object clause steps : 15
% 0.15/1.35 # Proof object formula steps : 15
% 0.15/1.35 # Proof object conjectures : 6
% 0.15/1.35 # Proof object clause conjectures : 3
% 0.15/1.35 # Proof object formula conjectures : 3
% 0.15/1.35 # Proof object initial clauses used : 9
% 0.15/1.35 # Proof object initial formulas used : 8
% 0.15/1.35 # Proof object generating inferences : 5
% 0.15/1.35 # Proof object simplifying inferences : 7
% 0.15/1.35 # Training examples: 0 positive, 0 negative
% 0.15/1.35 # Parsed axioms : 62
% 0.15/1.35 # Removed by relevancy pruning/SinE : 45
% 0.15/1.35 # Initial clauses : 18
% 0.15/1.35 # Removed in clause preprocessing : 0
% 0.15/1.35 # Initial clauses in saturation : 18
% 0.15/1.35 # Processed clauses : 27
% 0.15/1.35 # ...of these trivial : 0
% 0.15/1.35 # ...subsumed : 2
% 0.15/1.35 # ...remaining for further processing : 25
% 0.15/1.35 # Other redundant clauses eliminated : 0
% 0.15/1.35 # Clauses deleted for lack of memory : 0
% 0.15/1.35 # Backward-subsumed : 0
% 0.15/1.35 # Backward-rewritten : 1
% 0.15/1.35 # Generated clauses : 16
% 0.15/1.35 # ...of the previous two non-trivial : 14
% 0.15/1.35 # Contextual simplify-reflections : 0
% 0.15/1.35 # Paramodulations : 16
% 0.15/1.35 # Factorizations : 0
% 0.15/1.35 # Equation resolutions : 0
% 0.15/1.35 # Current number of processed clauses : 24
% 0.15/1.35 # Positive orientable unit clauses : 9
% 0.15/1.35 # Positive unorientable unit clauses: 0
% 0.15/1.35 # Negative unit clauses : 2
% 0.15/1.35 # Non-unit-clauses : 13
% 0.15/1.35 # Current number of unprocessed clauses: 2
% 0.15/1.35 # ...number of literals in the above : 4
% 0.15/1.35 # Current number of archived formulas : 0
% 0.15/1.35 # Current number of archived clauses : 1
% 0.15/1.35 # Clause-clause subsumption calls (NU) : 19
% 0.15/1.35 # Rec. Clause-clause subsumption calls : 13
% 0.15/1.35 # Non-unit clause-clause subsumptions : 2
% 0.15/1.35 # Unit Clause-clause subsumption calls : 3
% 0.15/1.35 # Rewrite failures with RHS unbound : 0
% 0.15/1.35 # BW rewrite match attempts : 1
% 0.15/1.35 # BW rewrite match successes : 1
% 0.15/1.35 # Condensation attempts : 0
% 0.15/1.35 # Condensation successes : 0
% 0.15/1.35 # Termbank termtop insertions : 1294
% 0.15/1.35
% 0.15/1.35 # -------------------------------------------------
% 0.15/1.35 # User time : 0.007 s
% 0.15/1.35 # System time : 0.003 s
% 0.15/1.35 # Total time : 0.010 s
% 0.15/1.35 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------