TSTP Solution File: CSR038+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR038+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:31:32 EDT 2024
% Result : Theorem 1.72s 1.84s
% Output : CNFRefutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 11 |; 4 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-4 aty)
% Number of variables : 23 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query138,conjecture,
? [X15] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptp_8_968(X15,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
& tptpcol_16_7738(X15) ) ),
file('/export/starexec/sandbox/tmp/tmp.oJZwMByQxF/E---3.1_4869.p',query138) ).
fof(ax2_7785,axiom,
! [X15] :
( isa(X15,c_tptpcol_16_7738)
=> tptpcol_16_7738(X15) ),
file('/export/starexec/sandbox/tmp/tmp.oJZwMByQxF/E---3.1_4869.p',ax2_7785) ).
fof(ax2_85,axiom,
! [X7] :
( isa(X7,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
=> tptp_8_968(f_relationexistsallfn(X7,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X7) ),
file('/export/starexec/sandbox/tmp/tmp.oJZwMByQxF/E---3.1_4869.p',ax2_85) ).
fof(ax2_1129,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox/tmp/tmp.oJZwMByQxF/E---3.1_4869.p',ax2_1129) ).
fof(ax2_453,axiom,
! [X7,X8,X9,X10] :
( ( isa(X7,X8)
& relationexistsall(X9,X10,X8) )
=> isa(f_relationexistsallfn(X7,X9,X10,X8),X10) ),
file('/export/starexec/sandbox/tmp/tmp.oJZwMByQxF/E---3.1_4869.p',ax2_453) ).
fof(ax2_86,axiom,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox/tmp/tmp.oJZwMByQxF/E---3.1_4869.p',ax2_86) ).
fof(c_0_6,negated_conjecture,
~ ? [X15] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptp_8_968(X15,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
& tptpcol_16_7738(X15) ) ),
inference(assume_negation,[status(cth)],[query138]) ).
fof(c_0_7,negated_conjecture,
! [X23] :
( mtvisible(c_knowledgefragmentd3mt)
& ( ~ tptp_8_968(X23,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
| ~ tptpcol_16_7738(X23) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X24] :
( ~ isa(X24,c_tptpcol_16_7738)
| tptpcol_16_7738(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7785])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
| ~ tptpcol_16_7738(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( tptpcol_16_7738(X1)
| ~ isa(X1,c_tptpcol_16_7738) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X26] :
( ~ isa(X26,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
| tptp_8_968(f_relationexistsallfn(X26,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_85])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
| ~ isa(X1,c_tptpcol_16_7738) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1)
| ~ isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[ax2_1129]) ).
fof(c_0_15,plain,
! [X32,X33,X34,X35] :
( ~ isa(X32,X33)
| ~ relationexistsall(X34,X35,X33)
| isa(f_relationexistsallfn(X32,X34,X35,X33),X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_453])])]) ).
cnf(c_0_16,negated_conjecture,
~ isa(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( isa(f_relationexistsallfn(X1,X3,X4,X2),X4)
| ~ isa(X1,X2)
| ~ relationexistsall(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[ax2_86]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.70/0.76 % Problem : CSR038+3 : TPTP v8.1.2. Released v3.4.0.
% 0.76/0.77 % Command : run_E %s %d THM
% 0.77/0.97 % Computer : n014.cluster.edu
% 0.77/0.97 % Model : x86_64 x86_64
% 0.77/0.97 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.77/0.97 % Memory : 8042.1875MB
% 0.77/0.97 % OS : Linux 3.10.0-693.el7.x86_64
% 0.77/0.97 % CPULimit : 300
% 0.77/0.98 % WCLimit : 300
% 0.77/0.98 % DateTime : Fri May 3 14:39:38 EDT 2024
% 0.77/0.98 % CPUTime :
% 0.94/1.72 Running first-order theorem proving
% 0.94/1.72 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.oJZwMByQxF/E---3.1_4869.p
% 1.72/1.84 # Version: 3.1.0
% 1.72/1.84 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.72/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.72/1.84 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.72/1.84 # Starting new_bool_3 with 300s (1) cores
% 1.72/1.84 # Starting new_bool_1 with 300s (1) cores
% 1.72/1.84 # Starting sh5l with 300s (1) cores
% 1.72/1.84 # new_bool_3 with pid 5023 completed with status 0
% 1.72/1.84 # Result found by new_bool_3
% 1.72/1.84 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.72/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.72/1.84 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.72/1.84 # Starting new_bool_3 with 300s (1) cores
% 1.72/1.84 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.72/1.84 # Search class: FHHNM-FFMM32-SFFFFFNN
% 1.72/1.84 # partial match(1): FHHNM-FFMM33-SFFFFFNN
% 1.72/1.84 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.72/1.84 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.72/1.84 # SAT001_MinMin_p005000_rr_RG with pid 5026 completed with status 0
% 1.72/1.84 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.72/1.84 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.72/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.72/1.84 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.72/1.84 # Starting new_bool_3 with 300s (1) cores
% 1.72/1.84 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.72/1.84 # Search class: FHHNM-FFMM32-SFFFFFNN
% 1.72/1.84 # partial match(1): FHHNM-FFMM33-SFFFFFNN
% 1.72/1.84 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.72/1.84 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.72/1.84 # Preprocessing time : 0.008 s
% 1.72/1.84 # Presaturation interreduction done
% 1.72/1.84
% 1.72/1.84 # Proof found!
% 1.72/1.84 # SZS status Theorem
% 1.72/1.84 # SZS output start CNFRefutation
% See solution above
% 1.72/1.84 # Parsed axioms : 8006
% 1.72/1.84 # Removed by relevancy pruning/SinE : 7943
% 1.72/1.84 # Initial clauses : 64
% 1.72/1.84 # Removed in clause preprocessing : 0
% 1.72/1.84 # Initial clauses in saturation : 64
% 1.72/1.84 # Processed clauses : 119
% 1.72/1.84 # ...of these trivial : 4
% 1.72/1.84 # ...subsumed : 13
% 1.72/1.84 # ...remaining for further processing : 102
% 1.72/1.84 # Other redundant clauses eliminated : 0
% 1.72/1.84 # Clauses deleted for lack of memory : 0
% 1.72/1.84 # Backward-subsumed : 0
% 1.72/1.84 # Backward-rewritten : 0
% 1.72/1.84 # Generated clauses : 19
% 1.72/1.84 # ...of the previous two non-redundant : 8
% 1.72/1.84 # ...aggressively subsumed : 0
% 1.72/1.84 # Contextual simplify-reflections : 0
% 1.72/1.84 # Paramodulations : 19
% 1.72/1.84 # Factorizations : 0
% 1.72/1.84 # NegExts : 0
% 1.72/1.84 # Equation resolutions : 0
% 1.72/1.84 # Disequality decompositions : 0
% 1.72/1.84 # Total rewrite steps : 14
% 1.72/1.84 # ...of those cached : 6
% 1.72/1.84 # Propositional unsat checks : 0
% 1.72/1.84 # Propositional check models : 0
% 1.72/1.84 # Propositional check unsatisfiable : 0
% 1.72/1.84 # Propositional clauses : 0
% 1.72/1.84 # Propositional clauses after purity: 0
% 1.72/1.84 # Propositional unsat core size : 0
% 1.72/1.84 # Propositional preprocessing time : 0.000
% 1.72/1.84 # Propositional encoding time : 0.000
% 1.72/1.84 # Propositional solver time : 0.000
% 1.72/1.84 # Success case prop preproc time : 0.000
% 1.72/1.84 # Success case prop encoding time : 0.000
% 1.72/1.84 # Success case prop solver time : 0.000
% 1.72/1.84 # Current number of processed clauses : 54
% 1.72/1.84 # Positive orientable unit clauses : 29
% 1.72/1.84 # Positive unorientable unit clauses: 0
% 1.72/1.84 # Negative unit clauses : 1
% 1.72/1.84 # Non-unit-clauses : 24
% 1.72/1.84 # Current number of unprocessed clauses: 1
% 1.72/1.84 # ...number of literals in the above : 2
% 1.72/1.84 # Current number of archived formulas : 0
% 1.72/1.84 # Current number of archived clauses : 48
% 1.72/1.84 # Clause-clause subsumption calls (NU) : 149
% 1.72/1.84 # Rec. Clause-clause subsumption calls : 119
% 1.72/1.84 # Non-unit clause-clause subsumptions : 13
% 1.72/1.84 # Unit Clause-clause subsumption calls : 0
% 1.72/1.84 # Rewrite failures with RHS unbound : 0
% 1.72/1.84 # BW rewrite match attempts : 0
% 1.72/1.84 # BW rewrite match successes : 0
% 1.72/1.84 # Condensation attempts : 0
% 1.72/1.84 # Condensation successes : 0
% 1.72/1.84 # Termbank termtop insertions : 54053
% 1.72/1.84 # Search garbage collected termcells : 31093
% 1.72/1.84
% 1.72/1.84 # -------------------------------------------------
% 1.72/1.84 # User time : 0.035 s
% 1.72/1.84 # System time : 0.024 s
% 1.72/1.84 # Total time : 0.059 s
% 1.72/1.84 # Maximum resident set size: 18164 pages
% 1.72/1.84
% 1.72/1.84 # -------------------------------------------------
% 1.72/1.84 # User time : 0.084 s
% 1.72/1.84 # System time : 0.029 s
% 1.72/1.84 # Total time : 0.113 s
% 1.72/1.84 # Maximum resident set size: 8068 pages
% 1.72/1.84 % E---3.1 exiting
% 1.72/1.84 % E exiting
%------------------------------------------------------------------------------