%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR063+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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:02 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 48 ( 11 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 75 ( 38 ~; 27 |; 1 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 47 ( 3 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(just16,axiom,
! [X1] :
( inanimateobject_nonnatural(X1)
=> inanimateobject(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just16) ).
fof(just14,axiom,
! [X1] :
( artifact(X1)
=> inanimateobject_nonnatural(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just14) ).
fof(just9,axiom,
! [X1] :
( computerdataartifact(X1)
=> artifact(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just9) ).
fof(just18,axiom,
! [X1] :
( inanimateobject(X1)
=> partiallytangible(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just18) ).
fof(just7,axiom,
! [X1] :
~ ( intangible(X1)
& partiallytangible(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just7) ).
fof(just5,axiom,
! [X1] :
( mathematicalorcomputationalthing(X1)
=> intangible(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just5) ).
fof(query63,conjecture,
~ disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query63) ).
fof(just11,axiom,
! [X1] :
( mathematicalthing(X1)
=> mathematicalorcomputationalthing(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just11) ).
fof(just22,axiom,
! [X7,X8] :
( disjointwith(X7,X8)
=> no(X7,X8) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just22) ).
fof(just2,axiom,
! [X1] :
( setorcollection(X1)
=> mathematicalthing(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just2) ).
fof(just44,axiom,
! [X9,X8] :
( no(X9,X8)
=> setorcollection(X9) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just44) ).
fof(just95,axiom,
! [X7] : computerdataartifact(f_urlreferentfn(X7)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just95) ).
fof(c_0_12,plain,
! [X2] :
( ~ inanimateobject_nonnatural(X2)
| inanimateobject(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just16])]) ).
fof(c_0_13,plain,
! [X2] :
( ~ artifact(X2)
| inanimateobject_nonnatural(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just14])]) ).
cnf(c_0_14,plain,
( inanimateobject(X1)
| ~ inanimateobject_nonnatural(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( inanimateobject_nonnatural(X1)
| ~ artifact(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X2] :
( ~ computerdataartifact(X2)
| artifact(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])]) ).
fof(c_0_17,plain,
! [X2] :
( ~ inanimateobject(X2)
| partiallytangible(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just18])]) ).
cnf(c_0_18,plain,
( inanimateobject(X1)
| ~ artifact(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( artifact(X1)
| ~ computerdataartifact(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X2] :
( ~ intangible(X2)
| ~ partiallytangible(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just7])]) ).
cnf(c_0_21,plain,
( partiallytangible(X1)
| ~ inanimateobject(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( inanimateobject(X1)
| ~ computerdataartifact(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ partiallytangible(X1)
| ~ intangible(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( partiallytangible(X1)
| ~ computerdataartifact(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_25,plain,
! [X2] :
( ~ mathematicalorcomputationalthing(X2)
| intangible(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just5])]) ).
fof(c_0_26,negated_conjecture,
~ ~ disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
inference(assume_negation,[status(cth)],[query63]) ).
cnf(c_0_27,plain,
( ~ intangible(X1)
| ~ computerdataartifact(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( intangible(X1)
| ~ mathematicalorcomputationalthing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_29,plain,
! [X2] :
( ~ mathematicalthing(X2)
| mathematicalorcomputationalthing(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])]) ).
fof(c_0_30,plain,
! [X9,X10] :
( ~ disjointwith(X9,X10)
| no(X9,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just22])]) ).
fof(c_0_31,negated_conjecture,
disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
inference(fof_simplification,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( ~ mathematicalorcomputationalthing(X1)
| ~ computerdataartifact(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( mathematicalorcomputationalthing(X1)
| ~ mathematicalthing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_34,plain,
! [X2] :
( ~ setorcollection(X2)
| mathematicalthing(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just2])]) ).
fof(c_0_35,plain,
! [X10,X11] :
( ~ no(X10,X11)
| setorcollection(X10) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just44])])])]) ).
cnf(c_0_36,plain,
( no(X1,X2)
| ~ disjointwith(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( ~ computerdataartifact(X1)
| ~ mathematicalthing(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( mathematicalthing(X1)
| ~ setorcollection(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_40,plain,
! [X8] : computerdataartifact(f_urlreferentfn(X8)),
inference(variable_rename,[status(thm)],[just95]) ).
cnf(c_0_41,plain,
( setorcollection(X1)
| ~ no(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,negated_conjecture,
no(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( ~ computerdataartifact(X1)
| ~ setorcollection(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
computerdataartifact(f_urlreferentfn(X1)),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,negated_conjecture,
setorcollection(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
~ setorcollection(f_urlreferentfn(X1)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_45,c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CSR063+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n006.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 : Sat Jun 11 01:41:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.016 s
% 0.21/1.40
% 0.21/1.40 # Failure: Out of unprocessed clauses!
% 0.21/1.40 # OLD status GaveUp
% 0.21/1.40 # Parsed axioms : 116
% 0.21/1.40 # Removed by relevancy pruning/SinE : 78
% 0.21/1.40 # Initial clauses : 38
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 38
% 0.21/1.40 # Processed clauses : 623
% 0.21/1.40 # ...of these trivial : 5
% 0.21/1.40 # ...subsumed : 471
% 0.21/1.40 # ...remaining for further processing : 147
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 1
% 0.21/1.40 # Backward-rewritten : 1
% 0.21/1.40 # Generated clauses : 647
% 0.21/1.40 # ...of the previous two non-trivial : 588
% 0.21/1.40 # Contextual simplify-reflections : 106
% 0.21/1.40 # Paramodulations : 647
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 145
% 0.21/1.40 # Positive orientable unit clauses : 21
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 4
% 0.21/1.40 # Non-unit-clauses : 120
% 0.21/1.40 # Current number of unprocessed clauses: 0
% 0.21/1.40 # ...number of literals in the above : 0
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 2
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 22911
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 19974
% 0.21/1.40 # Non-unit clause-clause subsumptions : 298
% 0.21/1.40 # Unit Clause-clause subsumption calls : 86
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 1
% 0.21/1.40 # BW rewrite match successes : 1
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 8364
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.030 s
% 0.21/1.40 # System time : 0.005 s
% 0.21/1.40 # Total time : 0.035 s
% 0.21/1.40 # Maximum resident set size: 3160 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.018 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 48
% 0.21/1.40 # Proof object clause steps : 23
% 0.21/1.40 # Proof object formula steps : 25
% 0.21/1.40 # Proof object conjectures : 7
% 0.21/1.40 # Proof object clause conjectures : 4
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 12
% 0.21/1.40 # Proof object initial formulas used : 12
% 0.21/1.40 # Proof object generating inferences : 10
% 0.21/1.40 # Proof object simplifying inferences : 1
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 116
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 116
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 116
% 0.21/1.40 # Processed clauses : 246
% 0.21/1.40 # ...of these trivial : 15
% 0.21/1.40 # ...subsumed : 23
% 0.21/1.40 # ...remaining for further processing : 208
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 1
% 0.21/1.40 # Generated clauses : 488
% 0.21/1.40 # ...of the previous two non-trivial : 262
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 487
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 206
% 0.21/1.40 # Positive orientable unit clauses : 108
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 1
% 0.21/1.40 # Non-unit-clauses : 97
% 0.21/1.40 # Current number of unprocessed clauses: 130
% 0.21/1.40 # ...number of literals in the above : 215
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 2
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 1733
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 1658
% 0.21/1.40 # Non-unit clause-clause subsumptions : 23
% 0.21/1.40 # Unit Clause-clause subsumption calls : 449
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 1
% 0.21/1.40 # BW rewrite match successes : 1
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 9312
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.023 s
% 0.21/1.40 # System time : 0.003 s
% 0.21/1.40 # Total time : 0.026 s
% 0.21/1.40 # Maximum resident set size: 3652 pages
%------------------------------------------------------------------------------