TSTP Solution File: CSR056+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR056+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:56 EDT 2022
% Result : Theorem 12.50s 22.68s
% Output : CNFRefutation 12.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 18 ~; 13 |; 3 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 17 ( 1 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query206,conjecture,
? [X24] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X24) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query206) ).
fof(ax3_17177,axiom,
! [X6] :
( ( mtvisible(c_tptp_member3717_mt)
& supplies(X6) )
=> tptpofobject(X6,f_tptpquantityfn_17(n_385)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_17177) ).
fof(ax3_44208,axiom,
! [X22,X23] :
( ( mtvisible(X22)
& genlmt(X22,X23) )
=> mtvisible(X23) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_44208) ).
fof(ax3_22608,axiom,
! [X1] :
( artsupplies(X1)
=> supplies(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_22608) ).
fof(ax3_1048,axiom,
( mtvisible(c_cyclistsmt)
=> artsupplies(c_tptpartsupplies) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_1048) ).
fof(ax3_2404,axiom,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_2404) ).
fof(ax3_86,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_86) ).
fof(c_0_7,negated_conjecture,
~ ? [X24] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X24) ),
inference(assume_negation,[status(cth)],[query206]) ).
fof(c_0_8,plain,
! [X7] :
( ~ mtvisible(c_tptp_member3717_mt)
| ~ supplies(X7)
| tptpofobject(X7,f_tptpquantityfn_17(n_385)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_17177])]) ).
fof(c_0_9,negated_conjecture,
! [X25] :
( mtvisible(c_tptp_member3717_mt)
& ~ tptpofobject(c_tptpartsupplies,X25) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_10,plain,
( tptpofobject(X1,f_tptpquantityfn_17(n_385))
| ~ supplies(X1)
| ~ mtvisible(c_tptp_member3717_mt) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X24,X25] :
( ~ mtvisible(X24)
| ~ genlmt(X24,X25)
| mtvisible(X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44208])]) ).
fof(c_0_13,plain,
! [X2] :
( ~ artsupplies(X2)
| supplies(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_22608])]) ).
fof(c_0_14,plain,
( ~ mtvisible(c_cyclistsmt)
| artsupplies(c_tptpartsupplies) ),
inference(fof_nnf,[status(thm)],[ax3_1048]) ).
cnf(c_0_15,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( tptpofobject(X1,f_tptpquantityfn_17(n_385))
| ~ supplies(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_17,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax3_2404]) ).
cnf(c_0_19,plain,
( supplies(X1)
| ~ artsupplies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ supplies(c_tptpartsupplies),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax3_86]) ).
cnf(c_0_23,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11])]) ).
cnf(c_0_24,plain,
~ mtvisible(c_cyclistsmt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_23])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CSR056+4 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n021.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 : Fri Jun 10 13:28:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 12.50/22.68 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 12.50/22.68 # Preprocessing time : 1.440 s
% 12.50/22.68
% 12.50/22.68 # Proof found!
% 12.50/22.68 # SZS status Theorem
% 12.50/22.68 # SZS output start CNFRefutation
% See solution above
% 12.50/22.68 # Proof object total steps : 26
% 12.50/22.68 # Proof object clause steps : 13
% 12.50/22.68 # Proof object formula steps : 13
% 12.50/22.68 # Proof object conjectures : 6
% 12.50/22.68 # Proof object clause conjectures : 3
% 12.50/22.68 # Proof object formula conjectures : 3
% 12.50/22.68 # Proof object initial clauses used : 8
% 12.50/22.68 # Proof object initial formulas used : 7
% 12.50/22.68 # Proof object generating inferences : 4
% 12.50/22.68 # Proof object simplifying inferences : 8
% 12.50/22.68 # Training examples: 0 positive, 0 negative
% 12.50/22.68 # Parsed axioms : 44217
% 12.50/22.68 # Removed by relevancy pruning/SinE : 0
% 12.50/22.68 # Initial clauses : 44218
% 12.50/22.68 # Removed in clause preprocessing : 3
% 12.50/22.68 # Initial clauses in saturation : 44215
% 12.50/22.68 # Processed clauses : 45921
% 12.50/22.68 # ...of these trivial : 1223
% 12.50/22.68 # ...subsumed : 853
% 12.50/22.68 # ...remaining for further processing : 43844
% 12.50/22.68 # Other redundant clauses eliminated : 2
% 12.50/22.68 # Clauses deleted for lack of memory : 198771
% 12.50/22.68 # Backward-subsumed : 1
% 12.50/22.68 # Backward-rewritten : 69
% 12.50/22.68 # Generated clauses : 274910
% 12.50/22.68 # ...of the previous two non-trivial : 247183
% 12.50/22.68 # Contextual simplify-reflections : 185
% 12.50/22.68 # Paramodulations : 274908
% 12.50/22.68 # Factorizations : 0
% 12.50/22.68 # Equation resolutions : 2
% 12.50/22.68 # Current number of processed clauses : 43772
% 12.50/22.68 # Positive orientable unit clauses : 22906
% 12.50/22.68 # Positive unorientable unit clauses: 0
% 12.50/22.68 # Negative unit clauses : 107
% 12.50/22.68 # Non-unit-clauses : 20759
% 12.50/22.68 # Current number of unprocessed clauses: 46635
% 12.50/22.68 # ...number of literals in the above : 84662
% 12.50/22.68 # Current number of archived formulas : 0
% 12.50/22.68 # Current number of archived clauses : 70
% 12.50/22.68 # Clause-clause subsumption calls (NU) : 38402868
% 12.50/22.68 # Rec. Clause-clause subsumption calls : 34913535
% 12.50/22.68 # Non-unit clause-clause subsumptions : 1029
% 12.50/22.68 # Unit Clause-clause subsumption calls : 359591
% 12.50/22.68 # Rewrite failures with RHS unbound : 0
% 12.50/22.68 # BW rewrite match attempts : 1638145
% 12.50/22.68 # BW rewrite match successes : 2
% 12.50/22.68 # Condensation attempts : 0
% 12.50/22.68 # Condensation successes : 0
% 12.50/22.68 # Termbank termtop insertions : 3970744
% 12.50/22.68
% 12.50/22.68 # -------------------------------------------------
% 12.50/22.68 # User time : 9.594 s
% 12.50/22.68 # System time : 0.239 s
% 12.50/22.68 # Total time : 9.833 s
% 12.50/22.68 # Maximum resident set size: 348440 pages
%------------------------------------------------------------------------------