TSTP Solution File: CSR075+5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR075+5 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Sat May 4 07:32:12 EDT 2024
% Result : Theorem 36.67s 10.47s
% Output : CNFRefutation 36.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 52 ( 23 ~; 19 |; 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 : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 30 ( 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/sandbox/tmp/tmp.vXaR2eFXfA/E---3.1_11174.p',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/sandbox/tmp/tmp.vXaR2eFXfA/E---3.1_11174.p',kb_SUMO_26) ).
fof(prove_from_SUMO_MILO,conjecture,
? [X1223] : s__member(X1223,s__Org1_1),
file('/export/starexec/sandbox/tmp/tmp.vXaR2eFXfA/E---3.1_11174.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/sandbox/tmp/tmp.vXaR2eFXfA/E---3.1_11174.p',kb_SUMO_734) ).
fof(kb_SUMO_7890,axiom,
s__subclass(s__Organization,s__Group),
file('/export/starexec/sandbox/tmp/tmp.vXaR2eFXfA/E---3.1_11174.p',kb_SUMO_7890) ).
fof(kb_SUMO_7741,axiom,
s__subclass(s__Group,s__Collection),
file('/export/starexec/sandbox/tmp/tmp.vXaR2eFXfA/E---3.1_11174.p',kb_SUMO_7741) ).
fof(local_1,axiom,
s__instance(s__Org1_1,s__Organization),
file('/export/starexec/sandbox/tmp/tmp.vXaR2eFXfA/E---3.1_11174.p',local_1) ).
fof(c_0_7,plain,
! [X1290,X1291,X1292] :
( ~ s__instance(X1291,s__SetOrClass)
| ~ s__instance(X1290,s__SetOrClass)
| ~ s__subclass(X1290,X1291)
| ~ s__instance(X1292,X1290)
| s__instance(X1292,X1291) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_8,plain,
! [X1288,X1289] :
( ( s__instance(X1288,s__SetOrClass)
| ~ s__subclass(X1288,X1289) )
& ( s__instance(X1289,s__SetOrClass)
| ~ s__subclass(X1288,X1289) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
fof(c_0_9,negated_conjecture,
~ ? [X1223] : s__member(X1223,s__Org1_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_0_10,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_7]) ).
cnf(c_0_11,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,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_9])])]) ).
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(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
s__subclass(s__Organization,s__Group),
inference(split_conjunct,[status(thm)],[kb_SUMO_7890]) ).
cnf(c_0_17,plain,
s__subclass(s__Group,s__Collection),
inference(split_conjunct,[status(thm)],[kb_SUMO_7741]) ).
cnf(c_0_18,negated_conjecture,
~ s__member(X1,s__Org1_1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( s__member(esk1_1(X1),X1)
| ~ s__instance(X1,s__Collection) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( s__instance(X1,s__Group)
| ~ s__instance(X1,s__Organization) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( s__instance(X1,s__Collection)
| ~ s__instance(X1,s__Group) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ s__instance(s__Org1_1,s__Collection),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
s__instance(s__Org1_1,s__Organization),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_24,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_20,c_0_21,c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 2.81/2.86 % Problem : CSR075+5 : TPTP v8.1.2. Bugfixed v7.3.0.
% 2.81/2.87 % Command : run_E %s %d THM
% 2.87/3.08 % Computer : n013.cluster.edu
% 2.87/3.08 % Model : x86_64 x86_64
% 2.87/3.08 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 2.87/3.08 % Memory : 8042.1875MB
% 2.87/3.08 % OS : Linux 3.10.0-693.el7.x86_64
% 2.87/3.08 % CPULimit : 300
% 2.87/3.08 % WCLimit : 300
% 2.87/3.08 % DateTime : Fri May 3 14:51:25 EDT 2024
% 2.87/3.08 % CPUTime :
% 5.96/6.14 Running first-order theorem proving
% 5.96/6.14 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.vXaR2eFXfA/E---3.1_11174.p
% 36.67/10.47 # Version: 3.1.0
% 36.67/10.47 # Preprocessing class: FMLLSMSLSSSNFFN.
% 36.67/10.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.67/10.47 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 36.67/10.47 # Starting new_bool_3 with 300s (1) cores
% 36.67/10.47 # Starting new_bool_1 with 300s (1) cores
% 36.67/10.47 # Starting sh5l with 300s (1) cores
% 36.67/10.47 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 11252 completed with status 0
% 36.67/10.47 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 36.67/10.47 # Preprocessing class: FMLLSMSLSSSNFFN.
% 36.67/10.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.67/10.47 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 36.67/10.47 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 36.67/10.47 # Search class: FGHSM-SMLM31-MFFFFFNN
% 36.67/10.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 36.67/10.47 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 36.67/10.47 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 36.67/10.47 # Starting new_bool_3 with 136s (1) cores
% 36.67/10.47 # Starting new_bool_1 with 136s (1) cores
% 36.67/10.47 # Starting sh5l with 136s (1) cores
% 36.67/10.47 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 11259 completed with status 0
% 36.67/10.47 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 36.67/10.47 # Preprocessing class: FMLLSMSLSSSNFFN.
% 36.67/10.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.67/10.47 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 36.67/10.47 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 36.67/10.47 # Search class: FGHSM-SMLM31-MFFFFFNN
% 36.67/10.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 36.67/10.47 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 36.67/10.47 # Preprocessing time : 0.094 s
% 36.67/10.47 # Presaturation interreduction done
% 36.67/10.47 # SatCheck found unsatisfiable ground set
% 36.67/10.47
% 36.67/10.47 # Proof found!
% 36.67/10.47 # SZS status Theorem
% 36.67/10.47 # SZS output start CNFRefutation
% See solution above
% 36.67/10.47 # Parsed axioms : 16750
% 36.67/10.47 # Removed by relevancy pruning/SinE : 12975
% 36.67/10.47 # Initial clauses : 5289
% 36.67/10.47 # Removed in clause preprocessing : 57
% 36.67/10.47 # Initial clauses in saturation : 5232
% 36.67/10.47 # Processed clauses : 16500
% 36.67/10.47 # ...of these trivial : 810
% 36.67/10.47 # ...subsumed : 690
% 36.67/10.47 # ...remaining for further processing : 15000
% 36.67/10.47 # Other redundant clauses eliminated : 112
% 36.67/10.47 # Clauses deleted for lack of memory : 0
% 36.67/10.47 # Backward-subsumed : 44
% 36.67/10.47 # Backward-rewritten : 1643
% 36.67/10.47 # Generated clauses : 32415
% 36.67/10.47 # ...of the previous two non-redundant : 27414
% 36.67/10.47 # ...aggressively subsumed : 0
% 36.67/10.47 # Contextual simplify-reflections : 509
% 36.67/10.47 # Paramodulations : 32307
% 36.67/10.47 # Factorizations : 5
% 36.67/10.47 # NegExts : 0
% 36.67/10.47 # Equation resolutions : 113
% 36.67/10.47 # Disequality decompositions : 0
% 36.67/10.47 # Total rewrite steps : 4799
% 36.67/10.47 # ...of those cached : 2417
% 36.67/10.47 # Propositional unsat checks : 4
% 36.67/10.47 # Propositional check models : 3
% 36.67/10.47 # Propositional check unsatisfiable : 1
% 36.67/10.47 # Propositional clauses : 25526
% 36.67/10.47 # Propositional clauses after purity: 1186
% 36.67/10.47 # Propositional unsat core size : 4
% 36.67/10.47 # Propositional preprocessing time : 0.000
% 36.67/10.47 # Propositional encoding time : 0.077
% 36.67/10.47 # Propositional solver time : 0.031
% 36.67/10.47 # Success case prop preproc time : 0.000
% 36.67/10.47 # Success case prop encoding time : 0.033
% 36.67/10.47 # Success case prop solver time : 0.003
% 36.67/10.47 # Current number of processed clauses : 8147
% 36.67/10.47 # Positive orientable unit clauses : 2519
% 36.67/10.47 # Positive unorientable unit clauses: 4
% 36.67/10.47 # Negative unit clauses : 223
% 36.67/10.47 # Non-unit-clauses : 5401
% 36.67/10.47 # Current number of unprocessed clauses: 17379
% 36.67/10.47 # ...number of literals in the above : 59487
% 36.67/10.47 # Current number of archived formulas : 0
% 36.67/10.47 # Current number of archived clauses : 6797
% 36.67/10.47 # Clause-clause subsumption calls (NU) : 8117685
% 36.67/10.47 # Rec. Clause-clause subsumption calls : 3024142
% 36.67/10.47 # Non-unit clause-clause subsumptions : 1210
% 36.67/10.47 # Unit Clause-clause subsumption calls : 2432468
% 36.67/10.47 # Rewrite failures with RHS unbound : 0
% 36.67/10.47 # BW rewrite match attempts : 3116
% 36.67/10.47 # BW rewrite match successes : 1417
% 36.67/10.47 # Condensation attempts : 0
% 36.67/10.47 # Condensation successes : 0
% 36.67/10.47 # Termbank termtop insertions : 1100609
% 36.67/10.47 # Search garbage collected termcells : 134200
% 36.67/10.47
% 36.67/10.47 # -------------------------------------------------
% 36.67/10.47 # User time : 3.918 s
% 36.67/10.47 # System time : 0.157 s
% 36.67/10.47 # Total time : 4.075 s
% 36.67/10.47 # Maximum resident set size: 50352 pages
% 36.67/10.47
% 36.67/10.47 # -------------------------------------------------
% 36.67/10.47 # User time : 18.537 s
% 36.67/10.47 # System time : 0.334 s
% 36.67/10.47 # Total time : 18.871 s
% 36.67/10.47 # Maximum resident set size: 18652 pages
% 36.67/10.47 % E---3.1 exiting
% 36.67/10.47 % E exiting
%------------------------------------------------------------------------------