TSTP Solution File: CSR056+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR056+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 0.81s 1.99s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 17 ~; 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(query156,conjecture,
? [X23] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X23) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query156) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).
fof(ax2_856,axiom,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_856) ).
fof(ax2_842,axiom,
! [X2] :
( ( mtvisible(c_tptp_member3717_mt)
& supplies(X2) )
=> tptpofobject(X2,f_tptpquantityfn_17(n_385)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_842) ).
fof(ax2_1986,axiom,
( mtvisible(c_cyclistsmt)
=> artsupplies(c_tptpartsupplies) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_1986) ).
fof(ax2_4288,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_4288) ).
fof(ax2_1480,axiom,
! [X1] :
( artsupplies(X1)
=> supplies(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_1480) ).
fof(c_0_7,negated_conjecture,
~ ? [X23] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X23) ),
inference(assume_negation,[status(cth)],[query156]) ).
fof(c_0_8,plain,
! [X23,X24] :
( ~ mtvisible(X23)
| ~ genlmt(X23,X24)
| mtvisible(X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])]) ).
fof(c_0_9,negated_conjecture,
! [X24] :
( mtvisible(c_tptp_member3717_mt)
& ~ tptpofobject(c_tptpartsupplies,X24) ),
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,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax2_856]) ).
cnf(c_0_12,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X3] :
( ~ mtvisible(c_tptp_member3717_mt)
| ~ supplies(X3)
| tptpofobject(X3,f_tptpquantityfn_17(n_385)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_842])]) ).
fof(c_0_14,plain,
( ~ mtvisible(c_cyclistsmt)
| artsupplies(c_tptpartsupplies) ),
inference(fof_nnf,[status(thm)],[ax2_1986]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax2_4288]) ).
cnf(c_0_16,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,plain,
( tptpofobject(X1,f_tptpquantityfn_17(n_385))
| ~ supplies(X1)
| ~ mtvisible(c_tptp_member3717_mt) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X2] :
( ~ artsupplies(X2)
| supplies(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1480])]) ).
cnf(c_0_19,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( tptpofobject(X1,f_tptpquantityfn_17(n_385))
| ~ supplies(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_12])]) ).
cnf(c_0_23,plain,
( supplies(X1)
| ~ artsupplies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
artsupplies(c_tptpartsupplies),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_25,negated_conjecture,
~ supplies(c_tptpartsupplies),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR056+3 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.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 : Thu Jun 9 16:41:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.81/1.99 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.81/1.99 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.81/1.99 # Preprocessing time : 0.152 s
% 0.81/1.99
% 0.81/1.99 # Failure: Out of unprocessed clauses!
% 0.81/1.99 # OLD status GaveUp
% 0.81/1.99 # Parsed axioms : 8006
% 0.81/1.99 # Removed by relevancy pruning/SinE : 7977
% 0.81/1.99 # Initial clauses : 30
% 0.81/1.99 # Removed in clause preprocessing : 0
% 0.81/1.99 # Initial clauses in saturation : 30
% 0.81/1.99 # Processed clauses : 54
% 0.81/1.99 # ...of these trivial : 2
% 0.81/1.99 # ...subsumed : 8
% 0.81/1.99 # ...remaining for further processing : 44
% 0.81/1.99 # Other redundant clauses eliminated : 0
% 0.81/1.99 # Clauses deleted for lack of memory : 0
% 0.81/1.99 # Backward-subsumed : 0
% 0.81/1.99 # Backward-rewritten : 2
% 0.81/1.99 # Generated clauses : 37
% 0.81/1.99 # ...of the previous two non-trivial : 25
% 0.81/1.99 # Contextual simplify-reflections : 0
% 0.81/1.99 # Paramodulations : 37
% 0.81/1.99 # Factorizations : 0
% 0.81/1.99 # Equation resolutions : 0
% 0.81/1.99 # Current number of processed clauses : 42
% 0.81/1.99 # Positive orientable unit clauses : 16
% 0.81/1.99 # Positive unorientable unit clauses: 0
% 0.81/1.99 # Negative unit clauses : 1
% 0.81/1.99 # Non-unit-clauses : 25
% 0.81/1.99 # Current number of unprocessed clauses: 0
% 0.81/1.99 # ...number of literals in the above : 0
% 0.81/1.99 # Current number of archived formulas : 0
% 0.81/1.99 # Current number of archived clauses : 2
% 0.81/1.99 # Clause-clause subsumption calls (NU) : 76
% 0.81/1.99 # Rec. Clause-clause subsumption calls : 76
% 0.81/1.99 # Non-unit clause-clause subsumptions : 8
% 0.81/1.99 # Unit Clause-clause subsumption calls : 1
% 0.81/1.99 # Rewrite failures with RHS unbound : 0
% 0.81/1.99 # BW rewrite match attempts : 1
% 0.81/1.99 # BW rewrite match successes : 1
% 0.81/1.99 # Condensation attempts : 0
% 0.81/1.99 # Condensation successes : 0
% 0.81/1.99 # Termbank termtop insertions : 52328
% 0.81/1.99
% 0.81/1.99 # -------------------------------------------------
% 0.81/1.99 # User time : 0.131 s
% 0.81/1.99 # System time : 0.022 s
% 0.81/1.99 # Total time : 0.153 s
% 0.81/1.99 # Maximum resident set size: 19676 pages
% 0.81/1.99 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.81/1.99 # Preprocessing time : 0.172 s
% 0.81/1.99
% 0.81/1.99 # Proof found!
% 0.81/1.99 # SZS status Theorem
% 0.81/1.99 # SZS output start CNFRefutation
% See solution above
% 0.81/1.99 # Proof object total steps : 27
% 0.81/1.99 # Proof object clause steps : 14
% 0.81/1.99 # Proof object formula steps : 13
% 0.81/1.99 # Proof object conjectures : 6
% 0.81/1.99 # Proof object clause conjectures : 3
% 0.81/1.99 # Proof object formula conjectures : 3
% 0.81/1.99 # Proof object initial clauses used : 8
% 0.81/1.99 # Proof object initial formulas used : 7
% 0.81/1.99 # Proof object generating inferences : 4
% 0.81/1.99 # Proof object simplifying inferences : 9
% 0.81/1.99 # Training examples: 0 positive, 0 negative
% 0.81/1.99 # Parsed axioms : 8006
% 0.81/1.99 # Removed by relevancy pruning/SinE : 0
% 0.81/1.99 # Initial clauses : 8007
% 0.81/1.99 # Removed in clause preprocessing : 0
% 0.81/1.99 # Initial clauses in saturation : 8007
% 0.81/1.99 # Processed clauses : 8669
% 0.81/1.99 # ...of these trivial : 557
% 0.81/1.99 # ...subsumed : 344
% 0.81/1.99 # ...remaining for further processing : 7768
% 0.81/1.99 # Other redundant clauses eliminated : 0
% 0.81/1.99 # Clauses deleted for lack of memory : 0
% 0.81/1.99 # Backward-subsumed : 3
% 0.81/1.99 # Backward-rewritten : 161
% 0.81/1.99 # Generated clauses : 23437
% 0.81/1.99 # ...of the previous two non-trivial : 21848
% 0.81/1.99 # Contextual simplify-reflections : 20
% 0.81/1.99 # Paramodulations : 23437
% 0.81/1.99 # Factorizations : 0
% 0.81/1.99 # Equation resolutions : 0
% 0.81/1.99 # Current number of processed clauses : 7604
% 0.81/1.99 # Positive orientable unit clauses : 3017
% 0.81/1.99 # Positive unorientable unit clauses: 0
% 0.81/1.99 # Negative unit clauses : 110
% 0.81/1.99 # Non-unit-clauses : 4477
% 0.81/1.99 # Current number of unprocessed clauses: 20874
% 0.81/1.99 # ...number of literals in the above : 37590
% 0.81/1.99 # Current number of archived formulas : 0
% 0.81/1.99 # Current number of archived clauses : 164
% 0.81/1.99 # Clause-clause subsumption calls (NU) : 2711436
% 0.81/1.99 # Rec. Clause-clause subsumption calls : 2542032
% 0.81/1.99 # Non-unit clause-clause subsumptions : 365
% 0.81/1.99 # Unit Clause-clause subsumption calls : 256460
% 0.81/1.99 # Rewrite failures with RHS unbound : 0
% 0.81/1.99 # BW rewrite match attempts : 2600
% 0.81/1.99 # BW rewrite match successes : 36
% 0.81/1.99 # Condensation attempts : 0
% 0.81/1.99 # Condensation successes : 0
% 0.81/1.99 # Termbank termtop insertions : 492076
% 0.81/1.99
% 0.81/1.99 # -------------------------------------------------
% 0.81/1.99 # User time : 0.763 s
% 0.81/1.99 # System time : 0.039 s
% 0.81/1.99 # Total time : 0.802 s
% 0.81/1.99 # Maximum resident set size: 68680 pages
%------------------------------------------------------------------------------