TSTP Solution File: CSR038+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR038+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:25 EDT 2024
% Result : Theorem 0.24s 0.62s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 38 ( 17 ~; 12 |; 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 : 24 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query88,conjecture,
? [X13] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
& tptpcol_16_7738(X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query88) ).
fof(ax1_673,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_7738)
=> tptpcol_16_7738(X13) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_673) ).
fof(ax1_244,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/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_244) ).
fof(ax1_64,axiom,
! [X7,X8,X3,X9] :
( ( isa(X7,X8)
& relationexistsall(X3,X9,X8) )
=> isa(f_relationexistsallfn(X7,X3,X9,X8),X9) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_64) ).
fof(ax1_134,axiom,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_134) ).
fof(ax1_245,axiom,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_245) ).
fof(c_0_6,negated_conjecture,
~ ? [X13] :
( mtvisible(c_knowledgefragmentd3mt)
=> ( tptp_8_968(X13,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
& tptpcol_16_7738(X13) ) ),
inference(assume_negation,[status(cth)],[query88]) ).
fof(c_0_7,negated_conjecture,
! [X22] :
( mtvisible(c_knowledgefragmentd3mt)
& ( ~ tptp_8_968(X22,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)
| ~ tptpcol_16_7738(X22) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X23] :
( ~ isa(X23,c_tptpcol_16_7738)
| tptpcol_16_7738(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_673])])]) ).
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,
! [X25] :
( ~ isa(X25,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))
| tptp_8_968(f_relationexistsallfn(X25,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_244])])]) ).
fof(c_0_12,plain,
! [X35,X36,X37,X38] :
( ~ isa(X35,X36)
| ~ relationexistsall(X37,X38,X36)
| isa(f_relationexistsallfn(X35,X37,X38,X36),X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_64])])]) ).
cnf(c_0_13,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_14,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_15,plain,
isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[ax1_134]) ).
cnf(c_0_16,plain,
( isa(f_relationexistsallfn(X1,X3,X4,X2),X4)
| ~ isa(X1,X2)
| ~ relationexistsall(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),
inference(split_conjunct,[status(thm)],[ax1_245]) ).
cnf(c_0_18,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_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,plain,
( isa(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738)
| ~ isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : CSR038+2 : TPTP v8.2.0. Released v3.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.39 % Computer : n002.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8042.1875MB
% 0.14/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Sun May 19 01:42:53 EDT 2024
% 0.14/0.39 % CPUTime :
% 0.24/0.52 Running first-order model finding
% 0.24/0.52 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
% 0.24/0.62 # Version: 3.1.0
% 0.24/0.62 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.24/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.24/0.62 # Starting new_bool_3 with 600s (2) cores
% 0.24/0.62 # Starting new_bool_1 with 600s (2) cores
% 0.24/0.62 # Starting sh5l with 300s (1) cores
% 0.24/0.62 # sh5l with pid 11974 completed with status 0
% 0.24/0.62 # Result found by sh5l
% 0.24/0.62 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.24/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.24/0.62 # Starting new_bool_3 with 600s (2) cores
% 0.24/0.62 # Starting new_bool_1 with 600s (2) cores
% 0.24/0.62 # Starting sh5l with 300s (1) cores
% 0.24/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.62 # Search class: FHHNM-FFMM31-SFFFFFNN
% 0.24/0.62 # partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.24/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.62 # SAT001_MinMin_p005000_rr_RG with pid 11979 completed with status 0
% 0.24/0.62 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.24/0.62 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.24/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.24/0.62 # Starting new_bool_3 with 600s (2) cores
% 0.24/0.62 # Starting new_bool_1 with 600s (2) cores
% 0.24/0.62 # Starting sh5l with 300s (1) cores
% 0.24/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.62 # Search class: FHHNM-FFMM31-SFFFFFNN
% 0.24/0.62 # partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.24/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.62 # Preprocessing time : 0.004 s
% 0.24/0.62 # Presaturation interreduction done
% 0.24/0.62
% 0.24/0.62 # Proof found!
% 0.24/0.62 # SZS status Theorem
% 0.24/0.62 # SZS output start CNFRefutation
% See solution above
% 0.24/0.62 # Parsed axioms : 1132
% 0.24/0.62 # Removed by relevancy pruning/SinE : 909
% 0.24/0.62 # Initial clauses : 224
% 0.24/0.62 # Removed in clause preprocessing : 0
% 0.24/0.62 # Initial clauses in saturation : 224
% 0.24/0.62 # Processed clauses : 886
% 0.24/0.62 # ...of these trivial : 1
% 0.24/0.62 # ...subsumed : 116
% 0.24/0.62 # ...remaining for further processing : 769
% 0.24/0.62 # Other redundant clauses eliminated : 0
% 0.24/0.62 # Clauses deleted for lack of memory : 0
% 0.24/0.62 # Backward-subsumed : 27
% 0.24/0.62 # Backward-rewritten : 0
% 0.24/0.62 # Generated clauses : 660
% 0.24/0.62 # ...of the previous two non-redundant : 482
% 0.24/0.62 # ...aggressively subsumed : 0
% 0.24/0.62 # Contextual simplify-reflections : 0
% 0.24/0.62 # Paramodulations : 660
% 0.24/0.62 # Factorizations : 0
% 0.24/0.62 # NegExts : 0
% 0.24/0.62 # Equation resolutions : 0
% 0.24/0.62 # Disequality decompositions : 0
% 0.24/0.62 # Total rewrite steps : 167
% 0.24/0.62 # ...of those cached : 94
% 0.24/0.62 # Propositional unsat checks : 0
% 0.24/0.62 # Propositional check models : 0
% 0.24/0.62 # Propositional check unsatisfiable : 0
% 0.24/0.62 # Propositional clauses : 0
% 0.24/0.62 # Propositional clauses after purity: 0
% 0.24/0.62 # Propositional unsat core size : 0
% 0.24/0.62 # Propositional preprocessing time : 0.000
% 0.24/0.62 # Propositional encoding time : 0.000
% 0.24/0.62 # Propositional solver time : 0.000
% 0.24/0.62 # Success case prop preproc time : 0.000
% 0.24/0.62 # Success case prop encoding time : 0.000
% 0.24/0.62 # Success case prop solver time : 0.000
% 0.24/0.62 # Current number of processed clauses : 530
% 0.24/0.62 # Positive orientable unit clauses : 202
% 0.24/0.62 # Positive unorientable unit clauses: 0
% 0.24/0.62 # Negative unit clauses : 38
% 0.24/0.62 # Non-unit-clauses : 290
% 0.24/0.62 # Current number of unprocessed clauses: 25
% 0.24/0.62 # ...number of literals in the above : 69
% 0.24/0.62 # Current number of archived formulas : 0
% 0.24/0.62 # Current number of archived clauses : 239
% 0.24/0.62 # Clause-clause subsumption calls (NU) : 21493
% 0.24/0.62 # Rec. Clause-clause subsumption calls : 18188
% 0.24/0.62 # Non-unit clause-clause subsumptions : 38
% 0.24/0.62 # Unit Clause-clause subsumption calls : 4080
% 0.24/0.62 # Rewrite failures with RHS unbound : 0
% 0.24/0.62 # BW rewrite match attempts : 0
% 0.24/0.62 # BW rewrite match successes : 0
% 0.24/0.62 # Condensation attempts : 0
% 0.24/0.62 # Condensation successes : 0
% 0.24/0.62 # Termbank termtop insertions : 23671
% 0.24/0.62 # Search garbage collected termcells : 5049
% 0.24/0.62
% 0.24/0.62 # -------------------------------------------------
% 0.24/0.62 # User time : 0.055 s
% 0.24/0.62 # System time : 0.010 s
% 0.24/0.62 # Total time : 0.065 s
% 0.24/0.62 # Maximum resident set size: 4612 pages
% 0.24/0.62
% 0.24/0.62 # -------------------------------------------------
% 0.24/0.62 # User time : 0.073 s
% 0.24/0.62 # System time : 0.013 s
% 0.24/0.62 # Total time : 0.086 s
% 0.24/0.62 # Maximum resident set size: 2648 pages
% 0.24/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------