TSTP Solution File: LAT286+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT286+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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 : Sun Jul 17 04:46:23 EDT 2022
% Result : Theorem 2.48s 113.65s
% Output : CNFRefutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 90 ( 3 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 104 ( 42 ~; 37 |; 17 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 2 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t15_lopclset) ).
fof(t13_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t13_lopclset) ).
fof(redefinition_m2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',redefinition_m2_subset_1) ).
fof(t8_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t8_lopclset) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',fc1_subset_1) ).
fof(dt_k1_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_k1_lopclset) ).
fof(fc1_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ~ v1_xboole_0(k1_lopclset(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fc1_lopclset) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(assume_negation,[status(cth)],[t15_lopclset]) ).
fof(c_0_8,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])]) ).
fof(c_0_9,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2)
| u1_struct_0(k6_lopclset(X2)) = k1_lopclset(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t13_lopclset])])]) ).
fof(c_0_10,plain,
! [X4,X5,X6,X6] :
( ( ~ m2_subset_1(X6,X4,X5)
| m1_subset_1(X6,X5)
| v1_xboole_0(X4)
| v1_xboole_0(X5)
| ~ m1_subset_1(X5,k1_zfmisc_1(X4)) )
& ( ~ m1_subset_1(X6,X5)
| m2_subset_1(X6,X4,X5)
| v1_xboole_0(X4)
| v1_xboole_0(X5)
| ~ m1_subset_1(X5,k1_zfmisc_1(X4)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[redefinition_m2_subset_1])])])])])])]) ).
fof(c_0_11,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2)
| m2_subset_1(k2_pre_topc(X2),k1_zfmisc_1(u1_struct_0(X2)),k1_lopclset(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t8_lopclset])])]) ).
fof(c_0_12,plain,
! [X2] : ~ v1_xboole_0(k1_zfmisc_1(X2)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_subset_1])]) ).
fof(c_0_13,plain,
! [X2] :
( v3_struct_0(X2)
| ~ l1_pre_topc(X2)
| m1_subset_1(k1_lopclset(X2),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X2)))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k1_lopclset])])]) ).
fof(c_0_14,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2)
| ~ v1_xboole_0(k1_lopclset(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_lopclset])])]) ).
cnf(c_0_15,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1)
| v3_struct_0(X1)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( v1_xboole_0(X1)
| v1_xboole_0(X2)
| m1_subset_1(X3,X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ m2_subset_1(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1))
| v3_struct_0(X1)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| v3_struct_0(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
( v3_struct_0(X1)
| ~ v1_xboole_0(k1_lopclset(X1))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_26,plain,
( v3_struct_0(X1)
| m1_subset_1(k2_pre_topc(X1),k1_lopclset(X1))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_25,c_0_26]),c_0_17]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LAT286+4 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 30 08:43:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.98/25.04 eprover: CPU time limit exceeded, terminating
% 1.98/25.06 eprover: CPU time limit exceeded, terminating
% 2.06/38.13 eprover: CPU time limit exceeded, terminating
% 2.06/38.49 eprover: CPU time limit exceeded, terminating
% 2.11/49.26 eprover: CPU time limit exceeded, terminating
% 2.25/74.33 eprover: CPU time limit exceeded, terminating
% 2.33/85.63 eprover: CPU time limit exceeded, terminating
% 2.33/88.09 eprover: CPU time limit exceeded, terminating
% 2.39/97.36 eprover: CPU time limit exceeded, terminating
% 2.41/101.31 eprover: CPU time limit exceeded, terminating
% 2.48/113.64 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 2.48/113.64 # Preprocessing time : 8.576 s
% 2.48/113.64
% 2.48/113.64 # Failure: Out of unprocessed clauses!
% 2.48/113.64 # OLD status GaveUp
% 2.48/113.64 # Parsed axioms : 32138
% 2.48/113.64 # Removed by relevancy pruning/SinE : 0
% 2.48/113.64 # Initial clauses : 96493
% 2.48/113.64 # Removed in clause preprocessing : 8828
% 2.48/113.64 # Initial clauses in saturation : 87665
% 2.48/113.64 # Processed clauses : 16
% 2.48/113.64 # ...of these trivial : 0
% 2.48/113.64 # ...subsumed : 2
% 2.48/113.64 # ...remaining for further processing : 14
% 2.48/113.64 # Other redundant clauses eliminated : 0
% 2.48/113.64 # Clauses deleted for lack of memory : 87649
% 2.48/113.64 # Backward-subsumed : 0
% 2.48/113.64 # Backward-rewritten : 0
% 2.48/113.64 # Generated clauses : 0
% 2.48/113.64 # ...of the previous two non-trivial : 0
% 2.48/113.64 # Contextual simplify-reflections : 0
% 2.48/113.64 # Paramodulations : 0
% 2.48/113.64 # Factorizations : 0
% 2.48/113.64 # Equation resolutions : 0
% 2.48/113.64 # Current number of processed clauses : 14
% 2.48/113.64 # Positive orientable unit clauses : 3
% 2.48/113.64 # Positive unorientable unit clauses: 0
% 2.48/113.64 # Negative unit clauses : 9
% 2.48/113.64 # Non-unit-clauses : 2
% 2.48/113.64 # Current number of unprocessed clauses: 0
% 2.48/113.64 # ...number of literals in the above : 0
% 2.48/113.64 # Current number of archived formulas : 0
% 2.48/113.64 # Current number of archived clauses : 0
% 2.48/113.64 # Clause-clause subsumption calls (NU) : 2
% 2.48/113.64 # Rec. Clause-clause subsumption calls : 1
% 2.48/113.64 # Non-unit clause-clause subsumptions : 0
% 2.48/113.64 # Unit Clause-clause subsumption calls : 1
% 2.48/113.64 # Rewrite failures with RHS unbound : 0
% 2.48/113.64 # BW rewrite match attempts : 0
% 2.48/113.64 # BW rewrite match successes : 0
% 2.48/113.64 # Condensation attempts : 0
% 2.48/113.64 # Condensation successes : 0
% 2.48/113.64 # Termbank termtop insertions : 9564503
% 2.48/113.64
% 2.48/113.64 # -------------------------------------------------
% 2.48/113.64 # User time : 13.111 s
% 2.48/113.64 # System time : 0.299 s
% 2.48/113.64 # Total time : 13.410 s
% 2.48/113.64 # Maximum resident set size: 384892 pages
% 2.48/113.65 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 2.48/113.65
% 2.48/113.65 # Failure: Resource limit exceeded (time)
% 2.48/113.65 # OLD status Res
% 2.48/113.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 2.48/113.65 # Preprocessing time : 1.269 s
% 2.48/113.65 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 2.48/113.65 # Preprocessing time : 8.379 s
% 2.48/113.65
% 2.48/113.65 # Failure: Out of unprocessed clauses!
% 2.48/113.65 # OLD status GaveUp
% 2.48/113.65 # Parsed axioms : 32138
% 2.48/113.65 # Removed by relevancy pruning/SinE : 0
% 2.48/113.65 # Initial clauses : 96493
% 2.48/113.65 # Removed in clause preprocessing : 8828
% 2.48/113.65 # Initial clauses in saturation : 87665
% 2.48/113.65 # Processed clauses : 16
% 2.48/113.65 # ...of these trivial : 0
% 2.48/113.65 # ...subsumed : 0
% 2.48/113.65 # ...remaining for further processing : 16
% 2.48/113.65 # Other redundant clauses eliminated : 0
% 2.48/113.65 # Clauses deleted for lack of memory : 87649
% 2.48/113.65 # Backward-subsumed : 0
% 2.48/113.65 # Backward-rewritten : 0
% 2.48/113.65 # Generated clauses : 0
% 2.48/113.65 # ...of the previous two non-trivial : 0
% 2.48/113.65 # Contextual simplify-reflections : 0
% 2.48/113.65 # Paramodulations : 0
% 2.48/113.65 # Factorizations : 0
% 2.48/113.65 # Equation resolutions : 0
% 2.48/113.65 # Current number of processed clauses : 16
% 2.48/113.65 # Positive orientable unit clauses : 14
% 2.48/113.65 # Positive unorientable unit clauses: 0
% 2.48/113.65 # Negative unit clauses : 1
% 2.48/113.65 # Non-unit-clauses : 1
% 2.48/113.65 # Current number of unprocessed clauses: 0
% 2.48/113.65 # ...number of literals in the above : 0
% 2.48/113.65 # Current number of archived formulas : 0
% 2.48/113.65 # Current number of archived clauses : 0
% 2.48/113.65 # Clause-clause subsumption calls (NU) : 0
% 2.48/113.65 # Rec. Clause-clause subsumption calls : 0
% 2.48/113.65 # Non-unit clause-clause subsumptions : 0
% 2.48/113.65 # Unit Clause-clause subsumption calls : 7
% 2.48/113.65 # Rewrite failures with RHS unbound : 0
% 2.48/113.65 # BW rewrite match attempts : 0
% 2.48/113.65 # BW rewrite match successes : 0
% 2.48/113.65 # Condensation attempts : 0
% 2.48/113.65 # Condensation successes : 0
% 2.48/113.65 # Termbank termtop insertions : 9564526
% 2.48/113.65
% 2.48/113.65 # -------------------------------------------------
% 2.48/113.65 # User time : 12.960 s
% 2.48/113.65 # System time : 0.291 s
% 2.48/113.65 # Total time : 13.251 s
% 2.48/113.65 # Maximum resident set size: 404528 pages
% 2.48/113.65 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 2.48/113.65 # Preprocessing time : 8.378 s
% 2.48/113.65
% 2.48/113.65 # Failure: Out of unprocessed clauses!
% 2.48/113.65 # OLD status GaveUp
% 2.48/113.65 # Parsed axioms : 32138
% 2.48/113.65 # Removed by relevancy pruning/SinE : 0
% 2.48/113.65 # Initial clauses : 96493
% 2.48/113.65 # Removed in clause preprocessing : 8828
% 2.48/113.65 # Initial clauses in saturation : 87665
% 2.48/113.65 # Processed clauses : 16
% 2.48/113.65 # ...of these trivial : 0
% 2.48/113.65 # ...subsumed : 5
% 2.48/113.65 # ...remaining for further processing : 11
% 2.48/113.65 # Other redundant clauses eliminated : 0
% 2.48/113.65 # Clauses deleted for lack of memory : 87650
% 2.48/113.65 # Backward-subsumed : 0
% 2.48/113.65 # Backward-rewritten : 1
% 2.48/113.65 # Generated clauses : 0
% 2.48/113.65 # ...of the previous two non-trivial : 1
% 2.48/113.65 # Contextual simplify-reflections : 0
% 2.48/113.65 # Paramodulations : 0
% 2.48/113.65 # Factorizations : 0
% 2.48/113.65 # Equation resolutions : 0
% 2.48/113.65 # Current number of processed clauses : 10
% 2.48/113.65 # Positive orientable unit clauses : 5
% 2.48/113.65 # Positive unorientable unit clauses: 0
% 2.48/113.65 # Negative unit clauses : 5
% 2.48/113.65 # Non-unit-clauses : 0
% 2.48/113.65 # Current number of unprocessed clauses: 0
% 2.48/113.65 # ...number of literals in the above : 0
% 2.48/113.65 # Current number of archived formulas : 0
% 2.48/113.65 # Current number of archived clauses : 1
% 2.48/113.65 # Clause-clause subsumption calls (NU) : 0
% 2.48/113.65 # Rec. Clause-clause subsumption calls : 0
% 2.48/113.65 # Non-unit clause-clause subsumptions : 0
% 2.48/113.65 # Unit Clause-clause subsumption calls : 4
% 2.48/113.65 # Rewrite failures with RHS unbound : 0
% 2.48/113.65 # BW rewrite match attempts : 1
% 2.48/113.65 # BW rewrite match successes : 1
% 2.48/113.65 # Condensation attempts : 0
% 2.48/113.65 # Condensation successes : 0
% 2.48/113.65 # Termbank termtop insertions : 9564495
% 2.48/113.65
% 2.48/113.65 # -------------------------------------------------
% 2.48/113.65 # User time : 12.977 s
% 2.48/113.65 # System time : 0.274 s
% 2.48/113.65 # Total time : 13.251 s
% 2.48/113.65 # Maximum resident set size: 368648 pages
% 2.48/113.65 # Running protocol protocol_eprover_fc511518e5f98a6b2c7baef820b71b6d1abb3e55 for 23 seconds:
% 2.48/113.65
% 2.48/113.65 # Failure: Resource limit exceeded (time)
% 2.48/113.65 # OLD status Res
% 2.48/113.65 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,80,1.0)
% 2.48/113.65 # Preprocessing time : 1.116 s
% 2.48/113.65 # Running protocol protocol_eprover_95b56b3f38545d2cfee43b45856d192a814b65d5 for 23 seconds:
% 2.48/113.65 # Preprocessing time : 8.141 s
% 2.48/113.65
% 2.48/113.65 # Failure: Out of unprocessed clauses!
% 2.48/113.65 # OLD status GaveUp
% 2.48/113.65 # Parsed axioms : 32138
% 2.48/113.65 # Removed by relevancy pruning/SinE : 0
% 2.48/113.65 # Initial clauses : 96493
% 2.48/113.65 # Removed in clause preprocessing : 8828
% 2.48/113.65 # Initial clauses in saturation : 87665
% 2.48/113.65 # Processed clauses : 16
% 2.48/113.65 # ...of these trivial : 0
% 2.48/113.65 # ...subsumed : 1
% 2.48/113.65 # ...remaining for further processing : 15
% 2.48/113.65 # Other redundant clauses eliminated : 1
% 2.48/113.65 # Clauses deleted for lack of memory : 87651
% 2.48/113.65 # Backward-subsumed : 0
% 2.48/113.65 # Backward-rewritten : 0
% 2.48/113.65 # Generated clauses : 2
% 2.48/113.65 # ...of the previous two non-trivial : 2
% 2.48/113.65 # Contextual simplify-reflections : 0
% 2.48/113.65 # Paramodulations : 1
% 2.48/113.65 # Factorizations : 0
% 2.48/113.65 # Equation resolutions : 1
% 2.48/113.65 # Current number of processed clauses : 14
% 2.48/113.65 # Positive orientable unit clauses : 7
% 2.48/113.65 # Positive unorientable unit clauses: 0
% 2.48/113.65 # Negative unit clauses : 4
% 2.48/113.65 # Non-unit-clauses : 3
% 2.48/113.65 # Current number of unprocessed clauses: 0
% 2.48/113.65 # ...number of literals in the above : 0
% 2.48/113.65 # Current number of archived formulas : 0
% 2.48/113.65 # Current number of archived clauses : 0
% 2.48/113.65 # Clause-clause subsumption calls (NU) : 4
% 2.48/113.65 # Rec. Clause-clause subsumption calls : 1
% 2.48/113.65 # Non-unit clause-clause subsumptions : 1
% 2.48/113.65 # Unit Clause-clause subsumption calls : 15
% 2.48/113.65 # Rewrite failures with RHS unbound : 0
% 2.48/113.65 # BW rewrite match attempts : 0
% 2.48/113.65 # BW rewrite match successes : 0
% 2.48/113.65 # Condensation attempts : 0
% 2.48/113.65 # Condensation successes : 0
% 2.48/113.65 # Termbank termtop insertions : 9564539
% 2.48/113.65
% 2.48/113.65 # -------------------------------------------------
% 2.48/113.65 # User time : 12.650 s
% 2.48/113.65 # System time : 0.300 s
% 2.48/113.65 # Total time : 12.950 s
% 2.48/113.65 # Maximum resident set size: 381428 pages
% 2.48/113.65 # Running protocol protocol_eprover_6017f334107ca4679a9978dd19d7c76a8bd36e48 for 23 seconds:
% 2.48/113.65 # SinE strategy is GSinE(CountFormulas,,1.4,,02,20000,1.0)
% 2.48/113.65 # Preprocessing time : 1.125 s
% 2.48/113.65
% 2.48/113.65 # Proof found!
% 2.48/113.65 # SZS status Theorem
% 2.48/113.65 # SZS output start CNFRefutation
% See solution above
% 2.48/113.65 # Proof object total steps : 28
% 2.48/113.65 # Proof object clause steps : 13
% 2.48/113.65 # Proof object formula steps : 15
% 2.48/113.65 # Proof object conjectures : 9
% 2.48/113.65 # Proof object clause conjectures : 6
% 2.48/113.65 # Proof object formula conjectures : 3
% 2.48/113.65 # Proof object initial clauses used : 10
% 2.48/113.65 # Proof object initial formulas used : 7
% 2.48/113.65 # Proof object generating inferences : 3
% 2.48/113.65 # Proof object simplifying inferences : 11
% 2.48/113.65 # Training examples: 0 positive, 0 negative
% 2.48/113.65 # Parsed axioms : 32138
% 2.48/113.65 # Removed by relevancy pruning/SinE : 31608
% 2.48/113.65 # Initial clauses : 1104
% 2.48/113.65 # Removed in clause preprocessing : 39
% 2.48/113.65 # Initial clauses in saturation : 1065
% 2.48/113.65 # Processed clauses : 19273
% 2.48/113.65 # ...of these trivial : 215
% 2.48/113.65 # ...subsumed : 12879
% 2.48/113.65 # ...remaining for further processing : 6179
% 2.48/113.65 # Other redundant clauses eliminated : 1272
% 2.48/113.65 # Clauses deleted for lack of memory : 227571
% 2.48/113.65 # Backward-subsumed : 267
% 2.48/113.65 # Backward-rewritten : 369
% 2.48/113.65 # Generated clauses : 441798
% 2.48/113.65 # ...of the previous two non-trivial : 409593
% 2.48/113.65 # Contextual simplify-reflections : 11954
% 2.48/113.65 # Paramodulations : 438495
% 2.48/113.65 # Factorizations : 20
% 2.48/113.65 # Equation resolutions : 1543
% 2.48/113.65 # Current number of processed clauses : 5523
% 2.48/113.65 # Positive orientable unit clauses : 366
% 2.48/113.65 # Positive unorientable unit clauses: 25
% 2.48/113.65 # Negative unit clauses : 255
% 2.48/113.65 # Non-unit-clauses : 4877
% 2.48/113.65 # Current number of unprocessed clauses: 132600
% 2.48/113.65 # ...number of literals in the above : 588855
% 2.48/113.65 # Current number of archived formulas : 0
% 2.48/113.65 # Current number of archived clauses : 643
% 2.48/113.65 # Clause-clause subsumption calls (NU) : 8580867
% 2.48/113.65 # Rec. Clause-clause subsumption calls : 3266913
% 2.48/113.65 # Non-unit clause-clause subsumptions : 23462
% 2.48/113.65 # Unit Clause-clause subsumption calls : 494133
% 2.48/113.65 # Rewrite failures with RHS unbound : 0
% 2.48/113.65 # BW rewrite match attempts : 2280
% 2.48/113.65 # BW rewrite match successes : 494
% 2.48/113.65 # Condensation attempts : 0
% 2.48/113.65 # Condensation successes : 0
% 2.48/113.65 # Termbank termtop insertions : 6910763
% 2.48/113.65
% 2.48/113.65 # -------------------------------------------------
% 2.48/113.65 # User time : 11.506 s
% 2.48/113.65 # System time : 0.168 s
% 2.48/113.65 # Total time : 11.674 s
% 2.48/113.65 # Maximum resident set size: 196900 pages
% 2.48/120.39 eprover: CPU time limit exceeded, terminating
% 2.48/120.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/120.41 eprover: No such file or directory
% 2.48/120.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/120.41 eprover: No such file or directory
% 2.48/120.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/120.41 eprover: No such file or directory
% 2.48/120.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/120.42 eprover: No such file or directory
% 2.48/120.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/120.42 eprover: No such file or directory
% 2.48/120.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/120.42 eprover: No such file or directory
% 2.48/122.19 eprover: CPU time limit exceeded, terminating
% 2.48/122.21 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.48/122.21 eprover: No such file or directory
% 2.48/122.22 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.48/122.22 eprover: No such file or directory
% 2.48/122.23 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.48/122.23 eprover: No such file or directory
% 2.48/122.23 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.48/122.23 eprover: No such file or directory
% 2.48/122.24 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.48/122.24 eprover: No such file or directory
% 2.48/124.33 eprover: CPU time limit exceeded, terminating
% 2.48/124.35 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/124.35 eprover: No such file or directory
% 2.48/124.35 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/124.35 eprover: No such file or directory
% 2.48/124.36 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/124.36 eprover: No such file or directory
% 2.48/124.37 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/124.37 eprover: No such file or directory
% 2.48/124.37 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.48/124.37 eprover: No such file or directory
%------------------------------------------------------------------------------