TSTP Solution File: REL010+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL010+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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 : Mon Jul 18 19:19:08 EDT 2022
% Result : Theorem 0.21s 1.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of formulae : 83 ( 80 unt; 0 def)
% Number of atoms : 86 ( 85 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 118 ( 4 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X1,X2,X3] :
( meet(composition(X1,X2),X3) = zero
=> meet(X2,composition(converse(X1),X3)) = zero ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(modular_law_1,axiom,
! [X1,X2,X3] : join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)) = meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+1.ax',modular_law_1) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3] :
( meet(composition(X1,X2),X3) = zero
=> meet(X2,composition(converse(X1),X3)) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,negated_conjecture,
( meet(composition(esk1_0,esk2_0),esk3_0) = zero
& meet(esk2_0,composition(converse(esk1_0),esk3_0)) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_16,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_17,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_18,plain,
! [X2] : converse(converse(X2)) = X2,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
fof(c_0_19,plain,
! [X3,X4] : join(composition(converse(X3),complement(composition(X3,X4))),complement(X4)) = complement(X4),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_20,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_21,negated_conjecture,
meet(composition(esk1_0,esk2_0),esk3_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X2] : composition(X2,one) = X2,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_26,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
complement(join(complement(composition(esk1_0,esk2_0)),complement(esk3_0))) = zero,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
complement(join(complement(esk3_0),complement(composition(esk1_0,esk2_0)))) = zero,
inference(rw,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_33,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24]) ).
fof(c_0_34,plain,
! [X2] : zero = meet(X2,complement(X2)),
inference(variable_rename,[status(thm)],[def_zero]) ).
cnf(c_0_35,negated_conjecture,
join(zero,composition(converse(X1),complement(composition(X1,join(complement(esk3_0),complement(composition(esk1_0,esk2_0))))))) = zero,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
fof(c_0_37,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
cnf(c_0_38,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_39,plain,
! [X2] : top = join(X2,complement(X2)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_40,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_41,negated_conjecture,
join(zero,composition(X1,complement(composition(converse(X1),join(complement(esk3_0),complement(composition(esk1_0,esk2_0))))))) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_24]) ).
cnf(c_0_42,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_33,c_0_36]) ).
cnf(c_0_43,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_38,c_0_22]) ).
cnf(c_0_45,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,negated_conjecture,
join(zero,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36]),c_0_42]),c_0_32]) ).
cnf(c_0_48,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_49,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
join(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_45]),c_0_49]),c_0_27]) ).
cnf(c_0_52,negated_conjecture,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
join(complement(complement(X1)),complement(join(complement(X1),complement(composition(converse(X2),complement(composition(X2,X1))))))) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_31]) ).
cnf(c_0_54,negated_conjecture,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_52]) ).
fof(c_0_55,plain,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_56,plain,
complement(join(complement(X1),complement(X1))) = X1,
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_36]),c_0_42]),c_0_45]),c_0_49]),c_0_54]) ).
cnf(c_0_58,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,plain,
complement(join(X1,X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
join(complement(esk3_0),join(zero,complement(composition(esk1_0,esk2_0)))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_32]),c_0_46]),c_0_27]) ).
cnf(c_0_61,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_58,c_0_24]) ).
cnf(c_0_62,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_59]),c_0_46]),c_0_45]) ).
cnf(c_0_63,negated_conjecture,
join(complement(esk3_0),complement(composition(esk1_0,esk2_0))) = top,
inference(rw,[status(thm)],[c_0_60,c_0_52]) ).
cnf(c_0_64,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_61,c_0_45]) ).
cnf(c_0_65,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_27,c_0_62]) ).
fof(c_0_66,plain,
! [X4,X5,X6] : join(meet(composition(X4,X5),X6),meet(composition(X4,meet(X5,composition(converse(X4),X6))),X6)) = meet(composition(X4,meet(X5,composition(converse(X4),X6))),X6),
inference(variable_rename,[status(thm)],[modular_law_1]) ).
fof(c_0_67,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_68,negated_conjecture,
composition(converse(X1),complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_52]),c_0_63]) ).
cnf(c_0_69,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,plain,
join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)) = meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_71,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_72,negated_conjecture,
composition(top,complement(composition(top,top))) = zero,
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))) = complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_22]),c_0_22]),c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_74,negated_conjecture,
composition(X1,complement(composition(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_52]),c_0_65]),c_0_72]) ).
cnf(c_0_75,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))) = complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_27]),c_0_27]) ).
cnf(c_0_76,negated_conjecture,
complement(composition(top,top)) = zero,
inference(spm,[status(thm)],[c_0_42,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
meet(esk2_0,composition(converse(esk1_0),esk3_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_78,plain,
join(complement(join(complement(composition(converse(X1),X2)),complement(X3))),complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3))))))))) = complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3)))))))),
inference(spm,[status(thm)],[c_0_75,c_0_24]) ).
cnf(c_0_79,negated_conjecture,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[c_0_74,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_45,c_0_52]) ).
cnf(c_0_81,negated_conjecture,
complement(join(complement(esk2_0),complement(composition(converse(esk1_0),esk3_0)))) != zero,
inference(rw,[status(thm)],[c_0_77,c_0_22]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_63]),c_0_49]),c_0_79]),c_0_80]),c_0_62]),c_0_49]),c_0_54]),c_0_49]),c_0_79]),c_0_80]),c_0_62]),c_0_49]),c_0_27]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : REL010+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.11/0.31 % Computer : n016.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Fri Jul 8 14:43:38 EDT 2022
% 0.17/0.31 % CPUTime :
% 0.21/1.39 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.21/1.39 # Preprocessing time : 0.014 s
% 0.21/1.39
% 0.21/1.39 # Proof found!
% 0.21/1.39 # SZS status Theorem
% 0.21/1.39 # SZS output start CNFRefutation
% See solution above
% 0.21/1.39 # Proof object total steps : 83
% 0.21/1.39 # Proof object clause steps : 54
% 0.21/1.39 # Proof object formula steps : 29
% 0.21/1.39 # Proof object conjectures : 23
% 0.21/1.39 # Proof object clause conjectures : 20
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 15
% 0.21/1.39 # Proof object initial formulas used : 14
% 0.21/1.39 # Proof object generating inferences : 25
% 0.21/1.39 # Proof object simplifying inferences : 51
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 17
% 0.21/1.39 # Removed by relevancy pruning/SinE : 0
% 0.21/1.39 # Initial clauses : 18
% 0.21/1.39 # Removed in clause preprocessing : 1
% 0.21/1.39 # Initial clauses in saturation : 17
% 0.21/1.39 # Processed clauses : 315
% 0.21/1.39 # ...of these trivial : 107
% 0.21/1.39 # ...subsumed : 16
% 0.21/1.39 # ...remaining for further processing : 191
% 0.21/1.39 # Other redundant clauses eliminated : 0
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 0
% 0.21/1.39 # Backward-rewritten : 110
% 0.21/1.39 # Generated clauses : 3745
% 0.21/1.39 # ...of the previous two non-trivial : 2917
% 0.21/1.39 # Contextual simplify-reflections : 0
% 0.21/1.39 # Paramodulations : 3745
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 0
% 0.21/1.39 # Current number of processed clauses : 81
% 0.21/1.39 # Positive orientable unit clauses : 77
% 0.21/1.39 # Positive unorientable unit clauses: 3
% 0.21/1.39 # Negative unit clauses : 1
% 0.21/1.39 # Non-unit-clauses : 0
% 0.21/1.39 # Current number of unprocessed clauses: 1412
% 0.21/1.39 # ...number of literals in the above : 1412
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 111
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 0
% 0.21/1.39 # Non-unit clause-clause subsumptions : 0
% 0.21/1.39 # Unit Clause-clause subsumption calls : 12
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 422
% 0.21/1.39 # BW rewrite match successes : 111
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 78659
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.077 s
% 0.21/1.39 # System time : 0.003 s
% 0.21/1.39 # Total time : 0.080 s
% 0.21/1.39 # Maximum resident set size: 5988 pages
% 0.21/23.40 eprover: CPU time limit exceeded, terminating
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------