%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM299_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:11:53 PM UTC 2026
% Result : Theorem 4.98s 2.94s
% Output : CNFRefutation 4.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 73 ( 43 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 69 ( 26 ~; 13 |; 24 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 54 ( 0 sgn 46 !; 8 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vTStore: $tType ).
tff(decl_sort2,type,
vTable: $tType ).
tff(decl_sort3,type,
vQuery: $tType ).
tff(decl_sort4,type,
vOptQuery: $tType ).
tff(decl_sort5,type,
vTType: $tType ).
tff(decl_sort6,type,
vTTContext: $tType ).
tff(decl_26,type,
vtvalue: vTable > vQuery ).
tff(decl_28,type,
vsomeQuery: vQuery > vOptQuery ).
tff(decl_44,type,
vnoQuery: vOptQuery ).
tff(decl_52,type,
vUnion: ( vQuery * vQuery ) > vQuery ).
tff(decl_53,type,
vq1: vQuery ).
tff(decl_64,type,
vq2: vQuery ).
tff(decl_83,type,
visValue: vQuery > $o ).
tff(decl_97,type,
vreduce: ( vTStore * vQuery ) > vOptQuery ).
tff(decl_109,type,
visSomeQuery: vOptQuery > $o ).
tff(decl_110,type,
vstoreContextConsistent: ( vTTContext * vTStore ) > $o ).
tff(decl_112,type,
vptcheck: ( vTType * ( vQuery * vTTContext ) ) > $o ).
tff(decl_115,type,
vgetQuery: vOptQuery > vQuery ).
tff(decl_161,type,
esk25_1: vOptQuery > vQuery ).
tff(decl_326,type,
esk190_1: vQuery > vTable ).
tff(decl_405,type,
esk269_3: ( vTStore * ( vQuery * vTable ) ) > vTable ).
tff(decl_406,type,
esk270_3: ( vTStore * ( vQuery * vTable ) ) > vTable ).
tff(decl_516,type,
esk380_0: vTStore ).
tff(decl_517,type,
esk381_0: vTable ).
tff(decl_518,type,
esk382_0: vTTContext ).
tff(decl_519,type,
esk383_0: vTType ).
tff('Progress-Union-tvalue-q2-isSomeQuery-True',conjecture,
! [X294: vTStore,X53: vTable,X460: vTTContext] :
( ( ? [X462: vTType] : vptcheck(X460,vUnion(vq1,vq2),X462)
& ~ visValue(vUnion(vq1,vq2))
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) )
& ! [X299: vTable] : ( vq2 != vtvalue(X299) )
& visSomeQuery(vreduce(vq2,X294)) )
=> ? [X463: vQuery] : ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X463) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Progress-Union-tvalue-q2-isSomeQuery-True') ).
tff('reduce-5',axiom,
! [X53: vTable,X297: vQuery,X294: vTStore] :
( ( visSomeQuery(vreduce(X297,X294))
& ! [X298: vTable,X299: vTable] :
( ( X297 != vtvalue(X299) )
| ( X53 != X298 ) ) )
=> ( vreduce(vUnion(vtvalue(X53),X297),X294) = vsomeQuery(vUnion(vtvalue(X53),vgetQuery(vreduce(X297,X294)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduce-5') ).
tff('isValue-0',axiom,
! [X199: vTable] : visValue(vtvalue(X199)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isValue-0') ).
tff('isValue-true-INV',axiom,
! [X9: vQuery] :
( visValue(X9)
=> ? [X209: vTable] : ( X9 = vtvalue(X209) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isValue-true-INV') ).
tff('dom-OptQuery',axiom,
! [X36: vOptQuery] :
( ? [X9: vQuery] : ( X36 = vsomeQuery(X9) )
| ( X36 = vnoQuery ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dom-OptQuery') ).
tff('DIFF-noQuery-someQuery',axiom,
! [X9: vQuery] : ( vnoQuery != vsomeQuery(X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-noQuery-someQuery') ).
tff(c_0_6,negated_conjecture,
~ ! [X294: vTStore,X53: vTable,X460: vTTContext] :
( ( ? [X462: vTType] : vptcheck(X460,vUnion(vq1,vq2),X462)
& ~ visValue(vUnion(vq1,vq2))
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) )
& ! [X299: vTable] : ( vq2 != vtvalue(X299) )
& visSomeQuery(vreduce(vq2,X294)) )
=> ? [X463: vQuery] : ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X463) ) ),
inference(assume_negation,[status(cth)],['Progress-Union-tvalue-q2-isSomeQuery-True']) ).
tff(c_0_7,negated_conjecture,
~ ! [X294: vTStore,X53: vTable,X460: vTTContext] :
( ( ? [X462: vTType] : vptcheck(X460,vUnion(vq1,vq2),X462)
& ~ visValue(vUnion(vq1,vq2))
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) )
& ! [X299: vTable] : ( vq2 != vtvalue(X299) )
& visSomeQuery(vreduce(vq2,X294)) )
=> ? [X463: vQuery] : ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X463) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
tff(c_0_8,plain,
! [X53: vTable,X297: vQuery,X294: vTStore] :
( ( visSomeQuery(vreduce(X297,X294))
& ! [X298: vTable,X299: vTable] :
( ( X297 != vtvalue(X299) )
| ( X53 != X298 ) ) )
=> ( vreduce(vUnion(vtvalue(X53),X297),X294) = vsomeQuery(vUnion(vtvalue(X53),vgetQuery(vreduce(X297,X294)))) ) ),
inference(fof_simplification,[status(thm)],['reduce-5']) ).
tff(c_0_9,plain,
! [X1055: vTable] : visValue(vtvalue(X1055)),
inference(variable_rename,[status(thm)],['isValue-0']) ).
tff(c_0_10,negated_conjecture,
! [X1583: vTable,X1585: vQuery] :
( ( vreduce(vUnion(vq1,vq2),esk380_0) != vsomeQuery(X1585) )
& vptcheck(esk382_0,vUnion(vq1,vq2),esk383_0)
& ~ visValue(vUnion(vq1,vq2))
& vstoreContextConsistent(esk380_0,esk382_0)
& ( vq1 = vtvalue(esk381_0) )
& ( vq2 != vtvalue(X1583) )
& visSomeQuery(vreduce(vq2,esk380_0)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
tff(c_0_11,plain,
! [X1273: vTable,X1274: vQuery,X1275: vTStore] :
( ( ( vreduce(vUnion(vtvalue(X1273),X1274),X1275) = vsomeQuery(vUnion(vtvalue(X1273),vgetQuery(vreduce(X1274,X1275)))) )
| ~ visSomeQuery(vreduce(X1274,X1275))
| ( X1274 = vtvalue(esk270_3(X1273,X1274,X1275)) ) )
& ( ( vreduce(vUnion(vtvalue(X1273),X1274),X1275) = vsomeQuery(vUnion(vtvalue(X1273),vgetQuery(vreduce(X1274,X1275)))) )
| ~ visSomeQuery(vreduce(X1274,X1275))
| ( X1273 = esk269_3(X1273,X1274,X1275) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
tff(c_0_12,plain,
! [X1065: vQuery] :
( ( X1065 = vtvalue(esk190_1(X1065)) )
| ~ visValue(X1065) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['isValue-true-INV'])])])]) ).
tcf(c_0_13,plain,
! [X5: vTable] : visValue(vtvalue(X5)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,negated_conjecture,
vq1 = vtvalue(esk381_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tff(c_0_15,plain,
! [X602: vOptQuery] :
( ( X602 = vsomeQuery(esk25_1(X602)) )
| ( X602 = vnoQuery ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['dom-OptQuery'])]) ).
tff(c_0_16,plain,
! [X9: vQuery] : ( vnoQuery != vsomeQuery(X9) ),
inference(fof_simplification,[status(thm)],['DIFF-noQuery-someQuery']) ).
tcf(c_0_17,plain,
! [X4: vQuery,X5: vTable,X47: vTStore] :
( ~ visSomeQuery(vreduce(X4,X47))
| ( vreduce(vUnion(vtvalue(X5),X4),X47) = vsomeQuery(vUnion(vtvalue(X5),vgetQuery(vreduce(X4,X47)))) )
| ( X4 = vtvalue(esk270_3(X5,X4,X47)) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_18,negated_conjecture,
visSomeQuery(vreduce(vq2,esk380_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_19,negated_conjecture,
! [X5: vTable] : vq2 != vtvalue(X5),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_20,plain,
! [X4: vQuery] :
( ~ visValue(X4)
| ( X4 = vtvalue(esk190_1(X4)) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_21,negated_conjecture,
visValue(vq1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_22,negated_conjecture,
! [X4: vQuery] : vreduce(vUnion(vq1,vq2),esk380_0) != vsomeQuery(X4),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_23,plain,
! [X36: vOptQuery] :
( ( X36 = vsomeQuery(esk25_1(X36)) )
| ( X36 = vnoQuery ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tff(c_0_24,plain,
! [X606: vQuery] : ( vnoQuery != vsomeQuery(X606) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
tcf(c_0_25,negated_conjecture,
! [X5: vTable] : vsomeQuery(vUnion(vtvalue(X5),vgetQuery(vreduce(vq2,esk380_0)))) = vreduce(vUnion(vtvalue(X5),vq2),esk380_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
tcf(c_0_26,negated_conjecture,
vtvalue(esk190_1(vq1)) = vq1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
tcf(c_0_27,negated_conjecture,
vreduce(vUnion(vq1,vq2),esk380_0) = vnoQuery,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]) ).
tcf(c_0_28,plain,
! [X4: vQuery] : vnoQuery != vsomeQuery(X4),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : COM299_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 % Computer : n011.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Mon Sep 21 14:22:55 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.48 Running first-order theorem proving
% 0.16/0.48 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/benchmark/theBenchmark.p
% 4.98/2.94 % Version: 3.5.1
% 4.98/2.94 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.98/2.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.98/2.94 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.98/2.94 % Starting new_bool_3 with 300s (1) cores
% 4.98/2.94 % Starting new_bool_1 with 300s (1) cores
% 4.98/2.94 % Starting sh5l with 300s (1) cores
% 4.98/2.94 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2144880 completed with status 0
% 4.98/2.94 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.98/2.94 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.98/2.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.98/2.94 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.98/2.94 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.98/2.94 % No SInE strategy applied
% 4.98/2.94 % Search class: FGHSM-SMLM32-DFFFFFNN
% 4.98/2.94 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 4.98/2.94 % Starting SubtermCWHack with 136s (1) cores
% 4.98/2.94 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.98/2.94 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 4.98/2.94 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 4.98/2.94 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 4.98/2.94 % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2144891 completed with status 0
% 4.98/2.94 % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.98/2.94 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.98/2.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.98/2.94 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.98/2.94 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.98/2.94 % No SInE strategy applied
% 4.98/2.94 % Search class: FGHSM-SMLM32-DFFFFFNN
% 4.98/2.94 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 4.98/2.94 % Starting SubtermCWHack with 136s (1) cores
% 4.98/2.94 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.98/2.94 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 4.98/2.94 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 4.98/2.94 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 4.98/2.94 % Preprocessing time : 0.058 s
% 4.98/2.94 % Presaturation interreduction done
% 4.98/2.94
% 4.98/2.94 % Proof found!
% 4.98/2.94 % SZS status Theorem
% 4.98/2.94 % SZS output start CNFRefutation
% See solution above
% 4.98/2.94 % Parsed axioms : 412
% 4.98/2.94 % Removed by relevancy pruning/SinE : 0
% 4.98/2.94 % Initial clauses : 2917
% 4.98/2.94 % Removed in clause preprocessing : 124
% 4.98/2.94 % Initial clauses in saturation : 2793
% 4.98/2.94 % Processed clauses : 7945
% 4.98/2.94 % ...of these trivial : 217
% 4.98/2.94 % ...subsumed : 2932
% 4.98/2.94 % ...remaining for further processing : 4796
% 4.98/2.94 % Other redundant clauses eliminated : 1417
% 4.98/2.94 % Clauses deleted for lack of memory : 0
% 4.98/2.94 % Backward-subsumed : 42
% 4.98/2.94 % Backward-rewritten : 100
% 4.98/2.94 % Generated clauses : 19123
% 4.98/2.94 % ...of the previous two non-redundant : 13776
% 4.98/2.94 % ...aggressively subsumed : 0
% 4.98/2.94 % Contextual simplify-reflections : 13
% 4.98/2.94 % Paramodulations : 17639
% 4.98/2.94 % Factorizations : 15
% 4.98/2.94 % NegExts : 0
% 4.98/2.94 % Equation resolutions : 1480
% 4.98/2.94 % Disequality decompositions : 0
% 4.98/2.94 % Total rewrite steps : 5570
% 4.98/2.94 % ...of those cached : 4572
% 4.98/2.94 % Propositional unsat checks : 0
% 4.98/2.94 % Propositional check models : 0
% 4.98/2.94 % Propositional check unsatisfiable : 0
% 4.98/2.94 % Propositional clauses : 0
% 4.98/2.94 % Propositional clauses after purity: 0
% 4.98/2.94 % Propositional unsat core size : 0
% 4.98/2.94 % Propositional preprocessing time : 0.000
% 4.98/2.94 % Propositional encoding time : 0.000
% 4.98/2.94 % Propositional solver time : 0.000
% 4.98/2.94 % Success case prop preproc time : 0.000
% 4.98/2.94 % Success case prop encoding time : 0.000
% 4.98/2.94 % Success case prop solver time : 0.000
% 4.98/2.94 % Current number of processed clauses : 1888
% 4.98/2.94 % Positive orientable unit clauses : 569
% 4.98/2.94 % Positive unorientable unit clauses: 19
% 4.98/2.94 % Negative unit clauses : 88
% 4.98/2.94 % Non-unit-clauses : 1212
% 4.98/2.94 % Current number of unprocessed clauses: 10959
% 4.98/2.94 % ...number of literals in the above : 31590
% 4.98/2.94 % Current number of archived formulas : 0
% 4.98/2.94 % Current number of archived clauses : 2774
% 4.98/2.94 % Clause-clause subsumption calls (NU) : 1482053
% 4.98/2.94 % Rec. Clause-clause subsumption calls : 555427
% 4.98/2.94 % Non-unit clause-clause subsumptions : 2132
% 4.98/2.94 % Unit Clause-clause subsumption calls : 9607
% 4.98/2.94 % Rewrite failures with RHS unbound : 0
% 4.98/2.94 % BW rewrite match attempts : 21353
% 4.98/2.94 % BW rewrite match successes : 130
% 4.98/2.94 % Condensation attempts : 0
% 4.98/2.94 % Condensation successes : 0
% 4.98/2.94 % Termbank termtop insertions : 545503
% 4.98/2.94 % Search garbage collected termcells : 19689
% 4.98/2.94
% 4.98/2.94 % -------------------------------------------------
% 4.98/2.94 % User time : 2.242 s
% 4.98/2.94 % System time : 0.061 s
% 4.98/2.94 % Total time : 2.303 s
% 4.98/2.94 % Maximum resident set size: 9520 pages
% 4.98/2.94
% 4.98/2.94 % -------------------------------------------------
% 4.98/2.94 % User time : 10.383 s
% 4.98/2.94 % System time : 0.322 s
% 4.98/2.94 % Total time : 10.705 s
% 4.98/2.94 % Maximum resident set size: 5632 pages
% 4.98/2.94 % E exiting
%------------------------------------------------------------------------------