TSTP Solution File: CSR063+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR063+1 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 300s
% DateTime : Mon May 20 19:17:53 EDT 2024
% Result : Theorem 0.45s 0.52s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 9 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 73 ( 36 ~; 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/sandbox/benchmark/theBenchmark.p',just16) ).
fof(just14,axiom,
! [X1] :
( artifact(X1)
=> inanimateobject_nonnatural(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just14) ).
fof(just9,axiom,
! [X1] :
( computerdataartifact(X1)
=> artifact(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just9) ).
fof(just18,axiom,
! [X1] :
( inanimateobject(X1)
=> partiallytangible(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just18) ).
fof(just7,axiom,
! [X1] :
~ ( intangible(X1)
& partiallytangible(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just7) ).
fof(just5,axiom,
! [X1] :
( mathematicalorcomputationalthing(X1)
=> intangible(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just5) ).
fof(just11,axiom,
! [X1] :
( mathematicalthing(X1)
=> mathematicalorcomputationalthing(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just11) ).
fof(just2,axiom,
! [X1] :
( setorcollection(X1)
=> mathematicalthing(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just2) ).
fof(just22,axiom,
! [X7,X8] :
( disjointwith(X7,X8)
=> no(X7,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just22) ).
fof(query63,conjecture,
~ disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query63) ).
fof(just95,axiom,
! [X7] : computerdataartifact(f_urlreferentfn(X7)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just95) ).
fof(just44,axiom,
! [X9,X8] :
( no(X9,X8)
=> setorcollection(X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',just44) ).
fof(c_0_12,plain,
! [X143] :
( ~ inanimateobject_nonnatural(X143)
| inanimateobject(X143) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just16])])]) ).
fof(c_0_13,plain,
! [X138] :
( ~ artifact(X138)
| inanimateobject_nonnatural(X138) ),
inference(fof_nnf,[status(thm)],[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,
! [X110] :
( ~ computerdataartifact(X110)
| artifact(X110) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])])]) ).
fof(c_0_17,plain,
! [X116] :
( ~ inanimateobject(X116)
| partiallytangible(X116) ),
inference(fof_nnf,[status(thm)],[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,
! [X115] :
( ~ intangible(X115)
| ~ partiallytangible(X115) ),
inference(fof_nnf,[status(thm)],[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,
( ~ intangible(X1)
| ~ partiallytangible(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,
! [X119] :
( ~ mathematicalorcomputationalthing(X119)
| intangible(X119) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just5])])]) ).
cnf(c_0_26,plain,
( ~ intangible(X1)
| ~ computerdataartifact(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( intangible(X1)
| ~ mathematicalorcomputationalthing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X146] :
( ~ mathematicalthing(X146)
| mathematicalorcomputationalthing(X146) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])])]) ).
cnf(c_0_29,plain,
( ~ mathematicalorcomputationalthing(X1)
| ~ computerdataartifact(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( mathematicalorcomputationalthing(X1)
| ~ mathematicalthing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,plain,
! [X133] :
( ~ setorcollection(X133)
| mathematicalthing(X133) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just2])])]) ).
fof(c_0_32,plain,
! [X20,X21] :
( ~ disjointwith(X20,X21)
| no(X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just22])])]) ).
fof(c_0_33,negated_conjecture,
disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query63])]) ).
cnf(c_0_34,plain,
( ~ computerdataartifact(X1)
| ~ mathematicalthing(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( mathematicalthing(X1)
| ~ setorcollection(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_36,plain,
! [X42] : computerdataartifact(f_urlreferentfn(X42)),
inference(variable_rename,[status(thm)],[just95]) ).
fof(c_0_37,plain,
! [X61,X62] :
( ~ no(X61,X62)
| setorcollection(X61) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just44])])]) ).
cnf(c_0_38,plain,
( no(X1,X2)
| ~ disjointwith(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
( ~ computerdataartifact(X1)
| ~ setorcollection(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
computerdataartifact(f_urlreferentfn(X1)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
( setorcollection(X1)
| ~ no(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
no(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
~ setorcollection(f_urlreferentfn(X1)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR063+1 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 01:28:37 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.52 # Version: 3.1.0
% 0.45/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.45/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.45/0.52 # Starting sh5l with 300s (1) cores
% 0.45/0.52 # sh5l with pid 32285 completed with status 0
% 0.45/0.52 # Result found by sh5l
% 0.45/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.45/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.45/0.52 # Starting sh5l with 300s (1) cores
% 0.45/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.45/0.52 # Search class: FHHNM-FFMM11-SFFFFFNN
% 0.45/0.52 # partial match(1): FHHNS-FFMM11-SFFFFFNN
% 0.45/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.45/0.52 # SAT001_MinMin_p005000_rr_RG with pid 32288 completed with status 0
% 0.45/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.45/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.45/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.45/0.52 # Starting sh5l with 300s (1) cores
% 0.45/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.45/0.52 # Search class: FHHNM-FFMM11-SFFFFFNN
% 0.45/0.52 # partial match(1): FHHNS-FFMM11-SFFFFFNN
% 0.45/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.45/0.52 # Preprocessing time : 0.003 s
% 0.45/0.52 # Presaturation interreduction done
% 0.45/0.52
% 0.45/0.52 # Proof found!
% 0.45/0.52 # SZS status Theorem
% 0.45/0.52 # SZS output start CNFRefutation
% See solution above
% 0.45/0.52 # Parsed axioms : 116
% 0.45/0.52 # Removed by relevancy pruning/SinE : 31
% 0.45/0.52 # Initial clauses : 85
% 0.45/0.52 # Removed in clause preprocessing : 0
% 0.45/0.52 # Initial clauses in saturation : 85
% 0.45/0.52 # Processed clauses : 174
% 0.45/0.52 # ...of these trivial : 1
% 0.45/0.52 # ...subsumed : 18
% 0.45/0.52 # ...remaining for further processing : 155
% 0.45/0.52 # Other redundant clauses eliminated : 0
% 0.45/0.52 # Clauses deleted for lack of memory : 0
% 0.45/0.52 # Backward-subsumed : 0
% 0.45/0.52 # Backward-rewritten : 0
% 0.45/0.52 # Generated clauses : 63
% 0.45/0.52 # ...of the previous two non-redundant : 53
% 0.45/0.52 # ...aggressively subsumed : 0
% 0.45/0.52 # Contextual simplify-reflections : 0
% 0.45/0.52 # Paramodulations : 63
% 0.45/0.52 # Factorizations : 0
% 0.45/0.52 # NegExts : 0
% 0.45/0.52 # Equation resolutions : 0
% 0.45/0.52 # Disequality decompositions : 0
% 0.45/0.52 # Total rewrite steps : 1
% 0.45/0.52 # ...of those cached : 0
% 0.45/0.52 # Propositional unsat checks : 0
% 0.45/0.52 # Propositional check models : 0
% 0.45/0.52 # Propositional check unsatisfiable : 0
% 0.45/0.52 # Propositional clauses : 0
% 0.45/0.52 # Propositional clauses after purity: 0
% 0.45/0.52 # Propositional unsat core size : 0
% 0.45/0.52 # Propositional preprocessing time : 0.000
% 0.45/0.52 # Propositional encoding time : 0.000
% 0.45/0.52 # Propositional solver time : 0.000
% 0.45/0.52 # Success case prop preproc time : 0.000
% 0.45/0.52 # Success case prop encoding time : 0.000
% 0.45/0.52 # Success case prop solver time : 0.000
% 0.45/0.52 # Current number of processed clauses : 85
% 0.45/0.52 # Positive orientable unit clauses : 22
% 0.45/0.52 # Positive unorientable unit clauses: 0
% 0.45/0.52 # Negative unit clauses : 5
% 0.45/0.52 # Non-unit-clauses : 58
% 0.45/0.52 # Current number of unprocessed clauses: 33
% 0.45/0.52 # ...number of literals in the above : 75
% 0.45/0.52 # Current number of archived formulas : 0
% 0.45/0.52 # Current number of archived clauses : 70
% 0.45/0.52 # Clause-clause subsumption calls (NU) : 1831
% 0.45/0.52 # Rec. Clause-clause subsumption calls : 1806
% 0.45/0.52 # Non-unit clause-clause subsumptions : 14
% 0.45/0.52 # Unit Clause-clause subsumption calls : 43
% 0.45/0.52 # Rewrite failures with RHS unbound : 0
% 0.45/0.52 # BW rewrite match attempts : 0
% 0.45/0.52 # BW rewrite match successes : 0
% 0.45/0.52 # Condensation attempts : 0
% 0.45/0.52 # Condensation successes : 0
% 0.45/0.52 # Termbank termtop insertions : 5796
% 0.45/0.52 # Search garbage collected termcells : 923
% 0.45/0.52
% 0.45/0.52 # -------------------------------------------------
% 0.45/0.52 # User time : 0.013 s
% 0.45/0.52 # System time : 0.002 s
% 0.45/0.52 # Total time : 0.014 s
% 0.45/0.52 # Maximum resident set size: 2124 pages
% 0.45/0.52
% 0.45/0.52 # -------------------------------------------------
% 0.45/0.52 # User time : 0.014 s
% 0.45/0.52 # System time : 0.005 s
% 0.45/0.52 # Total time : 0.019 s
% 0.45/0.52 # Maximum resident set size: 1800 pages
% 0.45/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------