TSTP Solution File: CSR063+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR063+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 10 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 68 ( 32 ~; 26 |; 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 ( 4 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax1_196,axiom,
! [X1] :
( inanimateobject_nonnatural(X1)
=> inanimateobject(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_196) ).
fof(ax1_211,axiom,
! [X1] :
( artifact(X1)
=> inanimateobject_nonnatural(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_211) ).
fof(ax1_180,axiom,
! [X1] :
( mathematicalthing(X1)
=> mathematicalorcomputationalthing(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_180) ).
fof(ax1_112,axiom,
! [X1] :
( setorcollection(X1)
=> mathematicalthing(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_112) ).
fof(ax1_9,axiom,
! [X1] :
( inanimateobject(X1)
=> partiallytangible(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_9) ).
fof(ax1_132,axiom,
! [X1] :
( mathematicalorcomputationalthing(X1)
=> intangible(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_132) ).
fof(ax1_494,axiom,
! [X1] :
( computerdataartifact(X1)
=> artifact(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_494) ).
fof(ax1_3,axiom,
! [X1] :
~ ( intangible(X1)
& partiallytangible(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_3) ).
fof(ax1_1085,axiom,
! [X5] : computerdataartifact(f_urlreferentfn(X5)),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_1085) ).
fof(ax1_221,axiom,
! [X5,X6] :
( disjointwith(X5,X6)
=> no(X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_221) ).
fof(query113,conjecture,
~ disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query113) ).
fof(ax1_718,axiom,
! [X10,X6] :
( no(X10,X6)
=> setorcollection(X10) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_718) ).
fof(c_0_12,plain,
! [X443] :
( ~ inanimateobject_nonnatural(X443)
| inanimateobject(X443) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_196])])]) ).
fof(c_0_13,plain,
! [X436] :
( ~ artifact(X436)
| inanimateobject_nonnatural(X436) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_211])])]) ).
fof(c_0_14,plain,
! [X478] :
( ~ mathematicalthing(X478)
| mathematicalorcomputationalthing(X478) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_180])])]) ).
fof(c_0_15,plain,
! [X488] :
( ~ setorcollection(X488)
| mathematicalthing(X488) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_112])])]) ).
fof(c_0_16,plain,
! [X244] :
( ~ inanimateobject(X244)
| partiallytangible(X244) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_9])])]) ).
cnf(c_0_17,plain,
( inanimateobject(X1)
| ~ inanimateobject_nonnatural(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( inanimateobject_nonnatural(X1)
| ~ artifact(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X251] :
( ~ mathematicalorcomputationalthing(X251)
| intangible(X251) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_132])])]) ).
cnf(c_0_20,plain,
( mathematicalorcomputationalthing(X1)
| ~ mathematicalthing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( mathematicalthing(X1)
| ~ setorcollection(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( partiallytangible(X1)
| ~ inanimateobject(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( inanimateobject(X1)
| ~ artifact(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X220] :
( ~ computerdataartifact(X220)
| artifact(X220) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_494])])]) ).
fof(c_0_25,plain,
! [X243] :
( ~ intangible(X243)
| ~ partiallytangible(X243) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_3])])]) ).
cnf(c_0_26,plain,
( intangible(X1)
| ~ mathematicalorcomputationalthing(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( mathematicalorcomputationalthing(X1)
| ~ setorcollection(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( partiallytangible(X1)
| ~ artifact(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( artifact(X1)
| ~ computerdataartifact(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X42] : computerdataartifact(f_urlreferentfn(X42)),
inference(variable_rename,[status(thm)],[ax1_1085]) ).
fof(c_0_31,plain,
! [X22,X23] :
( ~ disjointwith(X22,X23)
| no(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_221])])]) ).
fof(c_0_32,negated_conjecture,
disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query113])]) ).
cnf(c_0_33,plain,
( ~ intangible(X1)
| ~ partiallytangible(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( intangible(X1)
| ~ setorcollection(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( partiallytangible(X1)
| ~ computerdataartifact(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
computerdataartifact(f_urlreferentfn(X1)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,plain,
! [X62,X63] :
( ~ no(X62,X63)
| setorcollection(X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_718])])]) ).
cnf(c_0_38,plain,
( no(X1,X2)
| ~ disjointwith(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
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_32]) ).
cnf(c_0_40,plain,
( ~ setorcollection(X1)
| ~ partiallytangible(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
partiallytangible(f_urlreferentfn(X1)),
inference(spm,[status(thm)],[c_0_35,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.13 % Problem : CSR063+2 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.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 00:30:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.20/0.58 # Version: 3.1.0
% 0.20/0.58 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/0.58 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.58 # Starting new_bool_1 with 600s (2) cores
% 0.20/0.58 # Starting sh5l with 300s (1) cores
% 0.20/0.58 # sh5l with pid 2520 completed with status 0
% 0.20/0.58 # Result found by sh5l
% 0.20/0.58 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/0.58 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.58 # Starting new_bool_1 with 600s (2) cores
% 0.20/0.58 # Starting sh5l with 300s (1) cores
% 0.20/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.58 # Search class: FHHNM-FSLM31-SFFFFFNN
% 0.20/0.58 # partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.20/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.20/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 2535 completed with status 0
% 0.20/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.58 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/0.58 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.58 # Starting new_bool_1 with 600s (2) cores
% 0.20/0.58 # Starting sh5l with 300s (1) cores
% 0.20/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.58 # Search class: FHHNM-FSLM31-SFFFFFNN
% 0.20/0.58 # partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.20/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.20/0.58 # Preprocessing time : 0.006 s
% 0.20/0.58 # Presaturation interreduction done
% 0.20/0.58
% 0.20/0.58 # Proof found!
% 0.20/0.58 # SZS status Theorem
% 0.20/0.58 # SZS output start CNFRefutation
% See solution above
% 0.20/0.58 # Parsed axioms : 1132
% 0.20/0.58 # Removed by relevancy pruning/SinE : 659
% 0.20/0.58 # Initial clauses : 473
% 0.20/0.58 # Removed in clause preprocessing : 0
% 0.20/0.58 # Initial clauses in saturation : 473
% 0.20/0.58 # Processed clauses : 849
% 0.20/0.58 # ...of these trivial : 0
% 0.20/0.58 # ...subsumed : 30
% 0.20/0.58 # ...remaining for further processing : 819
% 0.20/0.58 # Other redundant clauses eliminated : 0
% 0.20/0.58 # Clauses deleted for lack of memory : 0
% 0.20/0.58 # Backward-subsumed : 1
% 0.20/0.58 # Backward-rewritten : 1
% 0.20/0.58 # Generated clauses : 114
% 0.20/0.58 # ...of the previous two non-redundant : 82
% 0.20/0.58 # ...aggressively subsumed : 0
% 0.20/0.58 # Contextual simplify-reflections : 0
% 0.20/0.58 # Paramodulations : 114
% 0.20/0.58 # Factorizations : 0
% 0.20/0.58 # NegExts : 0
% 0.20/0.58 # Equation resolutions : 0
% 0.20/0.58 # Disequality decompositions : 0
% 0.20/0.58 # Total rewrite steps : 27
% 0.20/0.58 # ...of those cached : 5
% 0.20/0.58 # Propositional unsat checks : 0
% 0.20/0.58 # Propositional check models : 0
% 0.20/0.58 # Propositional check unsatisfiable : 0
% 0.20/0.58 # Propositional clauses : 0
% 0.20/0.58 # Propositional clauses after purity: 0
% 0.20/0.58 # Propositional unsat core size : 0
% 0.20/0.58 # Propositional preprocessing time : 0.000
% 0.20/0.58 # Propositional encoding time : 0.000
% 0.20/0.58 # Propositional solver time : 0.000
% 0.20/0.58 # Success case prop preproc time : 0.000
% 0.20/0.58 # Success case prop encoding time : 0.000
% 0.20/0.58 # Success case prop solver time : 0.000
% 0.20/0.58 # Current number of processed clauses : 376
% 0.20/0.58 # Positive orientable unit clauses : 150
% 0.20/0.58 # Positive unorientable unit clauses: 0
% 0.20/0.58 # Negative unit clauses : 3
% 0.20/0.58 # Non-unit-clauses : 223
% 0.20/0.58 # Current number of unprocessed clauses: 147
% 0.20/0.58 # ...number of literals in the above : 279
% 0.20/0.58 # Current number of archived formulas : 0
% 0.20/0.58 # Current number of archived clauses : 443
% 0.20/0.58 # Clause-clause subsumption calls (NU) : 26182
% 0.20/0.58 # Rec. Clause-clause subsumption calls : 24603
% 0.20/0.58 # Non-unit clause-clause subsumptions : 31
% 0.20/0.58 # Unit Clause-clause subsumption calls : 419
% 0.20/0.58 # Rewrite failures with RHS unbound : 0
% 0.20/0.58 # BW rewrite match attempts : 1
% 0.20/0.58 # BW rewrite match successes : 1
% 0.20/0.58 # Condensation attempts : 0
% 0.20/0.58 # Condensation successes : 0
% 0.20/0.58 # Termbank termtop insertions : 29785
% 0.20/0.58 # Search garbage collected termcells : 5899
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.053 s
% 0.20/0.58 # System time : 0.008 s
% 0.20/0.58 # Total time : 0.061 s
% 0.20/0.58 # Maximum resident set size: 4940 pages
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.068 s
% 0.20/0.58 # System time : 0.012 s
% 0.20/0.58 # Total time : 0.080 s
% 0.20/0.58 # Maximum resident set size: 2648 pages
% 0.20/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------