%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM293_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 0.65s 0.63s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 61 ( 21 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 69 ( 26 ~; 22 |; 16 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 48 :)
% 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_52,type,
vUnion: ( vQuery * vQuery ) > vQuery ).
tff(decl_53,type,
vq1: vQuery ).
tff(decl_64,type,
vq2: vQuery ).
tff(decl_97,type,
vreduce: ( vTStore * vQuery ) > vOptQuery ).
tff(decl_110,type,
vstoreContextConsistent: ( vTTContext * vTStore ) > $o ).
tff(decl_112,type,
vptcheck: ( vTType * ( vQuery * vTTContext ) ) > $o ).
tff(decl_120,type,
esk1_0: vTStore ).
tff(decl_121,type,
esk2_0: vTTContext ).
tff(decl_122,type,
esk3_0: vTType ).
tff(decl_123,type,
esk4_0: vQuery ).
tff(decl_141,type,
esk22_4: ( vQuery * ( vTType * ( vTTContext * vTStore ) ) ) > vTable ).
tff('Preservation-Union-q1',axiom,
! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vUnion(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ! [X182: vTable] : ( vq1 != vtvalue(X182) ) )
=> vptcheck(X460,X461,X54) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Union-q1') ).
tff('Preservation-Union-tvalue',axiom,
! [X461: vQuery,X53: vTable,X460: vTTContext,X294: vTStore,X54: vTType] :
( ( ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vUnion(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ( vq1 = vtvalue(X53) ) )
=> vptcheck(X460,X461,X54) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Union-tvalue') ).
tff('Preservation-Union',conjecture,
! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vUnion(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460) )
=> vptcheck(X460,X461,X54) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Union') ).
tff(c_0_3,plain,
! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vUnion(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460)
& ! [X182: vTable] : ( vq1 != vtvalue(X182) ) )
=> vptcheck(X460,X461,X54) ),
inference(fof_simplification,[status(thm)],['Preservation-Union-q1']) ).
tff(c_0_4,plain,
! [X559: vTStore,X560: vTTContext,X561: vTType,X562: vQuery] :
( vptcheck(X560,X562,X561)
| ( vreduce(vUnion(vq1,vq2),X559) != vsomeQuery(X562) )
| ~ vptcheck(X560,vUnion(vq1,vq2),X561)
| ~ vstoreContextConsistent(X559,X560)
| ( vq1 = vtvalue(esk22_4(X559,X560,X561,X562)) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
tff(c_0_5,plain,
! [X554: vQuery,X555: vTable,X556: vTTContext,X557: vTStore,X558: vTType] :
( vptcheck(X556,X554,X558)
| ( vreduce(vUnion(vq1,vq2),X557) != vsomeQuery(X554) )
| ~ vptcheck(X556,vUnion(vq1,vq2),X558)
| ~ vstoreContextConsistent(X557,X556)
| ( vq1 != vtvalue(X555) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Preservation-Union-tvalue'])])]) ).
tff(c_0_6,negated_conjecture,
~ ! [X294: vTStore,X460: vTTContext,X54: vTType,X461: vQuery] :
( ( ( vreduce(vUnion(vq1,vq2),X294) = vsomeQuery(X461) )
& vptcheck(X460,vUnion(vq1,vq2),X54)
& vstoreContextConsistent(X294,X460) )
=> vptcheck(X460,X461,X54) ),
inference(assume_negation,[status(cth)],['Preservation-Union']) ).
tcf(c_0_7,plain,
! [X18: vTType,X47: vTStore,X23: vTTContext,X4: vQuery] :
( ( vreduce(vUnion(vq1,vq2),X47) != vsomeQuery(X4) )
| ~ vptcheck(X23,vUnion(vq1,vq2),X18)
| ~ vstoreContextConsistent(X47,X23)
| vptcheck(X23,X4,X18)
| ( vq1 = vtvalue(esk22_4(X47,X23,X18,X4)) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_8,plain,
! [X18: vTType,X5: vTable,X47: vTStore,X23: vTTContext,X4: vQuery] :
( ( vreduce(vUnion(vq1,vq2),X47) != vsomeQuery(X4) )
| ~ vptcheck(X23,vUnion(vq1,vq2),X18)
| ~ vstoreContextConsistent(X47,X23)
| ( vq1 != vtvalue(X5) )
| vptcheck(X23,X4,X18) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tff(c_0_9,negated_conjecture,
( ~ vptcheck(esk2_0,esk4_0,esk3_0)
& ( vreduce(vUnion(vq1,vq2),esk1_0) = vsomeQuery(esk4_0) )
& vptcheck(esk2_0,vUnion(vq1,vq2),esk3_0)
& vstoreContextConsistent(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
tcf(c_0_10,plain,
! [X4: vQuery,X18: vTType,X47: vTStore,X23: vTTContext] :
( ~ vstoreContextConsistent(X47,X23)
| ~ vptcheck(X23,vUnion(vq1,vq2),X18)
| ( vreduce(vUnion(vq1,vq2),X47) != vsomeQuery(X4) )
| vptcheck(X23,X4,X18) ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
tcf(c_0_11,negated_conjecture,
vptcheck(esk2_0,vUnion(vq1,vq2),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_12,negated_conjecture,
! [X4: vQuery,X47: vTStore] :
( ~ vstoreContextConsistent(X47,esk2_0)
| ( vreduce(vUnion(vq1,vq2),X47) != vsomeQuery(X4) )
| vptcheck(esk2_0,X4,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_13,negated_conjecture,
vreduce(vUnion(vq1,vq2),esk1_0) = vsomeQuery(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,negated_conjecture,
~ vptcheck(esk2_0,esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,negated_conjecture,
! [X47: vTStore] :
( ~ vstoreContextConsistent(X47,esk2_0)
| ( vreduce(vUnion(vq1,vq2),X47) != vreduce(vUnion(vq1,vq2),esk1_0) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
tcf(c_0_16,negated_conjecture,
vstoreContextConsistent(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM293_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.36 % Computer : n005.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8046.5625MB
% 0.13/0.36 % OS : Linux 6.8.0-71-generic
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Sep 21 14:22:47 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.65/0.63 % Version: 3.5.1
% 0.65/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.65/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.65/0.63 % Starting sh5l with 300s (1) cores
% 0.65/0.63 % new_bool_3 with pid 3722418 completed with status 0
% 0.65/0.63 % Result found by new_bool_3
% 0.65/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.65/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.65/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/0.63 % Search class: FGUSM-FSLS31-MFFFFFNN
% 0.65/0.63 % partial match(1): FGHSM-FSLS31-MFFFFFNN
% 0.65/0.63 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.63 % Starting SubtermCWHack with 28s (1) cores
% 0.65/0.63 % SubtermCWHack with pid 3722421 completed with status 0
% 0.65/0.63 % Result found by SubtermCWHack
% 0.65/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.65/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.65/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.65/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.65/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/0.63 % Search class: FGUSM-FSLS31-MFFFFFNN
% 0.65/0.63 % partial match(1): FGHSM-FSLS31-MFFFFFNN
% 0.65/0.63 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.63 % Starting SubtermCWHack with 28s (1) cores
% 0.65/0.63 % Preprocessing time : 0.003 s
% 0.65/0.63
% 0.65/0.63 % Proof found!
% 0.65/0.63 % SZS status Theorem
% 0.65/0.63 % SZS output start CNFRefutation
% See solution above
% 0.65/0.63 % Parsed axioms : 414
% 0.65/0.63 % Removed by relevancy pruning/SinE : 316
% 0.65/0.63 % Initial clauses : 287
% 0.65/0.63 % Removed in clause preprocessing : 0
% 0.65/0.63 % Initial clauses in saturation : 287
% 0.65/0.63 % Processed clauses : 2545
% 0.65/0.63 % ...of these trivial : 21
% 0.65/0.63 % ...subsumed : 1614
% 0.65/0.63 % ...remaining for further processing : 910
% 0.65/0.63 % Other redundant clauses eliminated : 858
% 0.65/0.63 % Clauses deleted for lack of memory : 0
% 0.65/0.63 % Backward-subsumed : 50
% 0.65/0.63 % Backward-rewritten : 14
% 0.65/0.63 % Generated clauses : 15416
% 0.65/0.63 % ...of the previous two non-redundant : 13859
% 0.65/0.63 % ...aggressively subsumed : 0
% 0.65/0.63 % Contextual simplify-reflections : 6
% 0.65/0.63 % Paramodulations : 14519
% 0.65/0.63 % Factorizations : 3
% 0.65/0.63 % NegExts : 0
% 0.65/0.63 % Equation resolutions : 894
% 0.65/0.63 % Disequality decompositions : 0
% 0.65/0.63 % Total rewrite steps : 1572
% 0.65/0.63 % ...of those cached : 1420
% 0.65/0.63 % Propositional unsat checks : 0
% 0.65/0.63 % Propositional check models : 0
% 0.65/0.63 % Propositional check unsatisfiable : 0
% 0.65/0.63 % Propositional clauses : 0
% 0.65/0.63 % Propositional clauses after purity: 0
% 0.65/0.63 % Propositional unsat core size : 0
% 0.65/0.63 % Propositional preprocessing time : 0.000
% 0.65/0.63 % Propositional encoding time : 0.000
% 0.65/0.63 % Propositional solver time : 0.000
% 0.65/0.63 % Success case prop preproc time : 0.000
% 0.65/0.63 % Success case prop encoding time : 0.000
% 0.65/0.63 % Success case prop solver time : 0.000
% 0.65/0.63 % Current number of processed clauses : 844
% 0.65/0.63 % Positive orientable unit clauses : 47
% 0.65/0.63 % Positive unorientable unit clauses: 4
% 0.65/0.63 % Negative unit clauses : 22
% 0.65/0.63 % Non-unit-clauses : 771
% 0.65/0.63 % Current number of unprocessed clauses: 11533
% 0.65/0.63 % ...number of literals in the above : 50360
% 0.65/0.63 % Current number of archived formulas : 0
% 0.65/0.63 % Current number of archived clauses : 64
% 0.65/0.63 % Clause-clause subsumption calls (NU) : 156435
% 0.65/0.63 % Rec. Clause-clause subsumption calls : 107339
% 0.65/0.63 % Non-unit clause-clause subsumptions : 1513
% 0.65/0.63 % Unit Clause-clause subsumption calls : 2332
% 0.65/0.63 % Rewrite failures with RHS unbound : 159
% 0.65/0.63 % BW rewrite match attempts : 34
% 0.65/0.63 % BW rewrite match successes : 30
% 0.65/0.63 % Condensation attempts : 0
% 0.65/0.63 % Condensation successes : 0
% 0.65/0.63 % Termbank termtop insertions : 171433
% 0.65/0.63 % Search garbage collected termcells : 5759
% 0.65/0.63
% 0.65/0.63 % -------------------------------------------------
% 0.65/0.63 % User time : 0.163 s
% 0.65/0.63 % System time : 0.011 s
% 0.65/0.63 % Total time : 0.174 s
% 0.65/0.63 % Maximum resident set size: 4952 pages
% 0.65/0.63
% 0.65/0.63 % -------------------------------------------------
% 0.65/0.63 % User time : 0.177 s
% 0.65/0.63 % System time : 0.017 s
% 0.65/0.63 % Total time : 0.193 s
% 0.65/0.63 % Maximum resident set size: 5632 pages
% 0.65/0.63 % E exiting
%------------------------------------------------------------------------------