TSTP Solution File: CSR075+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR075+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:18:07 EDT 2024
% Result : Theorem 1.42s 1.22s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 49 ( 21 ~; 18 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 29 ( 3 sgn 13 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
! [X6,X7,X8] :
( ( s__instance(X7,s__SetOrClass)
& s__instance(X6,s__SetOrClass) )
=> ( ( s__subclass(X6,X7)
& s__instance(X8,X6) )
=> s__instance(X8,X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_27) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).
fof(local_1,axiom,
s__instance(s__Org1_1,s__Organization),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(prove_from_SUMO_MILO,conjecture,
? [X1223] : s__member(X1223,s__Org1_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_734,axiom,
! [X85] :
( s__instance(X85,s__Collection)
=> ? [X51] :
( s__instance(X51,s__SelfConnectedObject)
& s__member(X51,X85) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_734) ).
fof(kb_SUMO_16630,axiom,
s__subclass(s__Organization,s__Collection),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+4.ax',kb_SUMO_16630) ).
fof(c_0_6,plain,
! [X1325,X1326,X1327] :
( ~ s__instance(X1326,s__SetOrClass)
| ~ s__instance(X1325,s__SetOrClass)
| ~ s__subclass(X1325,X1326)
| ~ s__instance(X1327,X1325)
| s__instance(X1327,X1326) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_7,plain,
! [X1323,X1324] :
( ( s__instance(X1323,s__SetOrClass)
| ~ s__subclass(X1323,X1324) )
& ( s__instance(X1324,s__SetOrClass)
| ~ s__subclass(X1323,X1324) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
cnf(c_0_8,plain,
( s__instance(X3,X1)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__subclass(X2,X1)
| ~ s__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,plain,
s__instance(s__Org1_1,s__Organization),
inference(split_conjunct,[status(thm)],[local_1]) ).
fof(c_0_13,negated_conjecture,
~ ? [X1223] : s__member(X1223,s__Org1_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_14,plain,
! [X1227] :
( ( s__instance(esk1_1(X1227),s__SelfConnectedObject)
| ~ s__instance(X1227,s__Collection) )
& ( s__member(esk1_1(X1227),X1227)
| ~ s__instance(X1227,s__Collection) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_734])])])])]) ).
cnf(c_0_15,plain,
( s__instance(s__Org1_1,X1)
| ~ s__subclass(s__Organization,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
s__subclass(s__Organization,s__Collection),
inference(split_conjunct,[status(thm)],[kb_SUMO_16630]) ).
fof(c_0_17,negated_conjecture,
! [X1224] : ~ s__member(X1224,s__Org1_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_18,plain,
( s__member(esk1_1(X1),X1)
| ~ s__instance(X1,s__Collection) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
s__instance(s__Org1_1,s__Collection),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ s__member(X1,s__Org1_1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR075+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.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 : 300
% 0.13/0.34 % DateTime : Sun May 19 01:43:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.42/1.22 # Version: 3.1.0
% 1.42/1.22 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.42/1.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/1.22 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.42/1.22 # Starting new_bool_3 with 300s (1) cores
% 1.42/1.22 # Starting new_bool_1 with 300s (1) cores
% 1.42/1.22 # Starting sh5l with 300s (1) cores
% 1.42/1.22 # new_bool_3 with pid 30738 completed with status 0
% 1.42/1.22 # Result found by new_bool_3
% 1.42/1.22 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.42/1.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/1.22 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.42/1.22 # Starting new_bool_3 with 300s (1) cores
% 1.42/1.22 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.42/1.22 # Search class: FGHSS-FSLM21-MFFFFFNN
% 1.42/1.22 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 1.42/1.22 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.42/1.22 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 1.42/1.22 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 30741 completed with status 0
% 1.42/1.22 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 1.42/1.22 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.42/1.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/1.22 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.42/1.22 # Starting new_bool_3 with 300s (1) cores
% 1.42/1.22 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.42/1.22 # Search class: FGHSS-FSLM21-MFFFFFNN
% 1.42/1.22 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 1.42/1.22 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.42/1.22 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 1.42/1.22 # Preprocessing time : 0.007 s
% 1.42/1.22 # Presaturation interreduction done
% 1.42/1.22
% 1.42/1.22 # Proof found!
% 1.42/1.22 # SZS status Theorem
% 1.42/1.22 # SZS output start CNFRefutation
% See solution above
% 1.42/1.22 # Parsed axioms : 37983
% 1.42/1.22 # Removed by relevancy pruning/SinE : 37825
% 1.42/1.22 # Initial clauses : 174
% 1.42/1.22 # Removed in clause preprocessing : 4
% 1.42/1.22 # Initial clauses in saturation : 170
% 1.42/1.22 # Processed clauses : 653
% 1.42/1.22 # ...of these trivial : 110
% 1.42/1.22 # ...subsumed : 0
% 1.42/1.22 # ...remaining for further processing : 543
% 1.42/1.22 # Other redundant clauses eliminated : 1
% 1.42/1.22 # Clauses deleted for lack of memory : 0
% 1.42/1.22 # Backward-subsumed : 0
% 1.42/1.22 # Backward-rewritten : 2
% 1.42/1.22 # Generated clauses : 1045
% 1.42/1.22 # ...of the previous two non-redundant : 891
% 1.42/1.22 # ...aggressively subsumed : 0
% 1.42/1.22 # Contextual simplify-reflections : 23
% 1.42/1.22 # Paramodulations : 1044
% 1.42/1.22 # Factorizations : 0
% 1.42/1.22 # NegExts : 0
% 1.42/1.22 # Equation resolutions : 1
% 1.42/1.22 # Disequality decompositions : 0
% 1.42/1.22 # Total rewrite steps : 370
% 1.42/1.22 # ...of those cached : 277
% 1.42/1.22 # Propositional unsat checks : 0
% 1.42/1.22 # Propositional check models : 0
% 1.42/1.22 # Propositional check unsatisfiable : 0
% 1.42/1.22 # Propositional clauses : 0
% 1.42/1.22 # Propositional clauses after purity: 0
% 1.42/1.22 # Propositional unsat core size : 0
% 1.42/1.22 # Propositional preprocessing time : 0.000
% 1.42/1.22 # Propositional encoding time : 0.000
% 1.42/1.22 # Propositional solver time : 0.000
% 1.42/1.22 # Success case prop preproc time : 0.000
% 1.42/1.22 # Success case prop encoding time : 0.000
% 1.42/1.22 # Success case prop solver time : 0.000
% 1.42/1.22 # Current number of processed clauses : 375
% 1.42/1.22 # Positive orientable unit clauses : 151
% 1.42/1.22 # Positive unorientable unit clauses: 0
% 1.42/1.22 # Negative unit clauses : 2
% 1.42/1.22 # Non-unit-clauses : 222
% 1.42/1.22 # Current number of unprocessed clauses: 564
% 1.42/1.22 # ...number of literals in the above : 1278
% 1.42/1.22 # Current number of archived formulas : 0
% 1.42/1.22 # Current number of archived clauses : 167
% 1.42/1.22 # Clause-clause subsumption calls (NU) : 6433
% 1.42/1.22 # Rec. Clause-clause subsumption calls : 3530
% 1.42/1.22 # Non-unit clause-clause subsumptions : 23
% 1.42/1.22 # Unit Clause-clause subsumption calls : 328
% 1.42/1.22 # Rewrite failures with RHS unbound : 0
% 1.42/1.22 # BW rewrite match attempts : 3
% 1.42/1.22 # BW rewrite match successes : 2
% 1.42/1.22 # Condensation attempts : 0
% 1.42/1.22 # Condensation successes : 0
% 1.42/1.22 # Termbank termtop insertions : 271699
% 1.42/1.22 # Search garbage collected termcells : 126701
% 1.42/1.22
% 1.42/1.22 # -------------------------------------------------
% 1.42/1.22 # User time : 0.134 s
% 1.42/1.22 # System time : 0.068 s
% 1.42/1.22 # Total time : 0.201 s
% 1.42/1.22 # Maximum resident set size: 49252 pages
% 1.42/1.22
% 1.42/1.22 # -------------------------------------------------
% 1.42/1.22 # User time : 0.609 s
% 1.42/1.22 # System time : 0.101 s
% 1.42/1.22 # Total time : 0.709 s
% 1.42/1.22 # Maximum resident set size: 27828 pages
% 1.42/1.22 % E---3.1 exiting
%------------------------------------------------------------------------------