%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM267_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 : n007.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:50 PM UTC 2026
% Result : Theorem 0.21s 0.93s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 0 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 12 ( 11 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-4 aty)
% Number of variables : 71 ( 0 sgn 62 !; 9 ?; 71 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vQMap: $tType ).
tff(decl_sort2,type,
vQID: $tType ).
tff(decl_sort3,type,
vLabel: $tType ).
tff(decl_sort4,type,
vAType: $tType ).
tff(decl_sort5,type,
vEntry: $tType ).
tff(decl_sort6,type,
vMapConf: $tType ).
tff(decl_sort7,type,
vQuestionnaire: $tType ).
tff(decl_sort8,type,
vAnsMap: $tType ).
tff(decl_sort9,type,
vQConf: $tType ).
tff(decl_sort10,type,
vOptQConf: $tType ).
tff(decl_sort11,type,
vATMap: $tType ).
tff(decl_43,type,
vdefquestion: ( vAType * ( vLabel * vQID ) ) > vEntry ).
tff(decl_48,type,
vqseq: ( vQuestionnaire * vQuestionnaire ) > vQuestionnaire ).
tff(decl_50,type,
vqempty: vQuestionnaire ).
tff(decl_51,type,
vsomeQConf: vQConf > vOptQConf ).
tff(decl_56,type,
vQC: ( vQuestionnaire * ( vQMap * vAnsMap ) ) > vQConf ).
tff(decl_62,type,
vqsingle: vEntry > vQuestionnaire ).
tff(decl_63,type,
vMC: ( vATMap * vATMap ) > vMapConf ).
tff(decl_72,type,
vqmbind: ( vQMap * ( vAType * ( vLabel * vQID ) ) ) > vQMap ).
tff(decl_93,type,
visValue: vQuestionnaire > $o ).
tff(decl_94,type,
vtypeAM: vAnsMap > vATMap ).
tff(decl_113,type,
vreduce: ( vQMap * ( vAnsMap * vQuestionnaire ) ) > vOptQConf ).
tff(decl_117,type,
vtypeQM: vQMap > vATMap ).
tff(decl_130,type,
vptcheck: ( vMapConf * ( vQuestionnaire * vMapConf ) ) > $o ).
tff(decl_148,type,
esk1_0: vQMap ).
tff(decl_149,type,
esk2_0: vAType ).
tff(decl_150,type,
esk3_0: vATMap ).
tff(decl_151,type,
esk4_0: vATMap ).
tff(decl_152,type,
esk5_0: vLabel ).
tff(decl_153,type,
esk6_0: vAnsMap ).
tff(decl_154,type,
esk7_0: vQID ).
tff('Progress-qsingle-defquestion',conjecture,
! [X150: vQMap,X274: vAType,X359: vATMap,X500: vATMap,X72: vLabel,X126: vAnsMap,X71: vQID] :
( ( vptcheck(vMC(vtypeAM(X126),vtypeQM(X150)),vqsingle(vdefquestion(X71,X72,X274)),vMC(X359,X500))
& ~ visValue(vqsingle(vdefquestion(X71,X72,X274))) )
=> ? [X501: vAnsMap,X502: vQMap,X503: vQuestionnaire] : ( vreduce(vqsingle(vdefquestion(X71,X72,X274)),X126,X150) = vsomeQConf(vQC(X501,X502,X503)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-qsingle-defquestion') ).
tff('reduce-8',axiom,
! [X276: vQuestionnaire,X126: vAnsMap,X150: vQMap] : ( vreduce(vqseq(vqempty,X276),X126,X150) = vsomeQConf(vQC(X126,X150,X276)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduce-8') ).
tff('reduce-5',axiom,
! [X150: vQMap,X274: vAType,X72: vLabel,X126: vAnsMap,X71: vQID] : ( vreduce(vqsingle(vdefquestion(X71,X72,X274)),X126,X150) = vsomeQConf(vQC(X126,vqmbind(X71,X72,X274,X150),vqempty)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduce-5') ).
tff(c_0_3,negated_conjecture,
~ ! [X150: vQMap,X274: vAType,X359: vATMap,X500: vATMap,X72: vLabel,X126: vAnsMap,X71: vQID] :
( ( vptcheck(vMC(vtypeAM(X126),vtypeQM(X150)),vqsingle(vdefquestion(X71,X72,X274)),vMC(X359,X500))
& ~ visValue(vqsingle(vdefquestion(X71,X72,X274))) )
=> ? [X501: vAnsMap,X502: vQMap,X503: vQuestionnaire] : ( vreduce(vqsingle(vdefquestion(X71,X72,X274)),X126,X150) = vsomeQConf(vQC(X501,X502,X503)) ) ),
inference(assume_negation,[status(cth)],['Progress-qsingle-defquestion']) ).
tff(c_0_4,negated_conjecture,
~ ! [X150: vQMap,X274: vAType,X359: vATMap,X500: vATMap,X72: vLabel,X126: vAnsMap,X71: vQID] :
( ( vptcheck(vMC(vtypeAM(X126),vtypeQM(X150)),vqsingle(vdefquestion(X71,X72,X274)),vMC(X359,X500))
& ~ visValue(vqsingle(vdefquestion(X71,X72,X274))) )
=> ? [X501: vAnsMap,X502: vQMap,X503: vQuestionnaire] : ( vreduce(vqsingle(vdefquestion(X71,X72,X274)),X126,X150) = vsomeQConf(vQC(X501,X502,X503)) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_5,negated_conjecture,
! [X511: vAnsMap,X512: vQMap,X513: vQuestionnaire] :
( ( vreduce(vqsingle(vdefquestion(esk7_0,esk5_0,esk2_0)),esk6_0,esk1_0) != vsomeQConf(vQC(X511,X512,X513)) )
& vptcheck(vMC(vtypeAM(esk6_0),vtypeQM(esk1_0)),vqsingle(vdefquestion(esk7_0,esk5_0,esk2_0)),vMC(esk3_0,esk4_0))
& ~ visValue(vqsingle(vdefquestion(esk7_0,esk5_0,esk2_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_4])])])])]) ).
tff(c_0_6,plain,
! [X516: vQuestionnaire,X517: vAnsMap,X518: vQMap] : ( vreduce(vqseq(vqempty,X516),X517,X518) = vsomeQConf(vQC(X517,X518,X516)) ),
inference(variable_rename,[status(thm)],['reduce-8']) ).
tff(c_0_7,plain,
! [X572: vQMap,X573: vAType,X574: vLabel,X575: vAnsMap,X576: vQID] : ( vreduce(vqsingle(vdefquestion(X576,X574,X573)),X575,X572) = vsomeQConf(vQC(X575,vqmbind(X576,X574,X573,X572),vqempty)) ),
inference(variable_rename,[status(thm)],['reduce-5']) ).
tcf(c_0_8,negated_conjecture,
! [X11: vQMap,X55: vAnsMap,X32: vQuestionnaire] : vreduce(vqsingle(vdefquestion(esk7_0,esk5_0,esk2_0)),esk6_0,esk1_0) != vsomeQConf(vQC(X55,X11,X32)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_9,plain,
! [X11: vQMap,X55: vAnsMap,X32: vQuestionnaire] : vreduce(vqseq(vqempty,X32),X55,X11) = vsomeQConf(vQC(X55,X11,X32)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X2: vQID,X3: vLabel,X4: vAType,X55: vAnsMap,X11: vQMap] : vreduce(vqsingle(vdefquestion(X2,X3,X4)),X55,X11) = vsomeQConf(vQC(X55,vqmbind(X2,X3,X4,X11),vqempty)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,negated_conjecture,
! [X55: vAnsMap,X32: vQuestionnaire,X11: vQMap] : vreduce(vqsingle(vdefquestion(esk7_0,esk5_0,esk2_0)),esk6_0,esk1_0) != vreduce(vqseq(vqempty,X32),X55,X11),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
tcf(c_0_12,plain,
! [X2: vQID,X3: vLabel,X4: vAType,X55: vAnsMap,X11: vQMap] : vreduce(vqsingle(vdefquestion(X2,X3,X4)),X55,X11) = vreduce(vqseq(vqempty,vqempty),X55,vqmbind(X2,X3,X4,X11)),
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
tcf(c_0_13,negated_conjecture,
! [X55: vAnsMap,X32: vQuestionnaire,X11: vQMap] : vreduce(vqseq(vqempty,vqempty),esk6_0,vqmbind(esk7_0,esk5_0,esk2_0,esk1_0)) != vreduce(vqseq(vqempty,X32),X55,X11),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : COM267_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.64 % Computer : n007.cluster.edu
% 0.16/0.64 % Model : x86_64 x86_64
% 0.16/0.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.64 % Memory : 8046.5625MB
% 0.16/0.64 % OS : Linux 6.8.0-71-generic
% 0.16/0.64 % CPULimit : 300
% 0.16/0.64 % WCLimit : 300
% 0.16/0.64 % DateTime : Mon Sep 21 14:19:36 UTC 2026
% 0.16/0.65 % CPUTime :
% 0.16/0.65 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.71 Running first-order theorem proving
% 0.21/0.71 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.21/0.93 % Version: 3.5.1
% 0.21/0.93 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.93 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/0.93 % Starting new_bool_3 with 600s (2) cores
% 0.21/0.93 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.93 % Starting sh5l with 300s (1) cores
% 0.21/0.93 % new_bool_3 with pid 1318964 completed with status 0
% 0.21/0.93 % Result found by new_bool_3
% 0.21/0.93 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.93 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/0.93 % Starting new_bool_3 with 600s (2) cores
% 0.21/0.93 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.93 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.93 % Search class: FGUSM-FSLM32-MFFFFFNN
% 0.21/0.93 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.21/0.93 % Starting SubtermCWHack with 61s (1) cores
% 0.21/0.93 % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.21/0.93 % SAT001_MinMin_p005000_rr_RG with pid 1318968 completed with status 0
% 0.21/0.93 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.93 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.93 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/0.93 % Starting new_bool_3 with 600s (2) cores
% 0.21/0.93 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.93 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.93 % Search class: FGUSM-FSLM32-MFFFFFNN
% 0.21/0.93 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.21/0.93 % Starting SubtermCWHack with 61s (1) cores
% 0.21/0.93 % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.21/0.93 % Preprocessing time : 0.016 s
% 0.21/0.93 % Presaturation interreduction done
% 0.21/0.93
% 0.21/0.93 % Proof found!
% 0.21/0.93 % SZS status Theorem
% 0.21/0.93 % SZS output start CNFRefutation
% See solution above
% 0.21/0.93 % Parsed axioms : 504
% 0.21/0.93 % Removed by relevancy pruning/SinE : 324
% 0.21/0.93 % Initial clauses : 697
% 0.21/0.93 % Removed in clause preprocessing : 0
% 0.21/0.93 % Initial clauses in saturation : 697
% 0.21/0.93 % Processed clauses : 984
% 0.21/0.93 % ...of these trivial : 18
% 0.21/0.93 % ...subsumed : 261
% 0.21/0.93 % ...remaining for further processing : 705
% 0.21/0.93 % Other redundant clauses eliminated : 53
% 0.21/0.93 % Clauses deleted for lack of memory : 0
% 0.21/0.93 % Backward-subsumed : 1
% 0.21/0.93 % Backward-rewritten : 3
% 0.21/0.93 % Generated clauses : 357
% 0.21/0.93 % ...of the previous two non-redundant : 164
% 0.21/0.93 % ...aggressively subsumed : 0
% 0.21/0.93 % Contextual simplify-reflections : 6
% 0.21/0.93 % Paramodulations : 231
% 0.21/0.93 % Factorizations : 30
% 0.21/0.93 % NegExts : 0
% 0.21/0.93 % Equation resolutions : 96
% 0.21/0.93 % Disequality decompositions : 0
% 0.21/0.93 % Total rewrite steps : 137
% 0.21/0.93 % ...of those cached : 100
% 0.21/0.93 % Propositional unsat checks : 0
% 0.21/0.93 % Propositional check models : 0
% 0.21/0.93 % Propositional check unsatisfiable : 0
% 0.21/0.93 % Propositional clauses : 0
% 0.21/0.93 % Propositional clauses after purity: 0
% 0.21/0.93 % Propositional unsat core size : 0
% 0.21/0.93 % Propositional preprocessing time : 0.000
% 0.21/0.93 % Propositional encoding time : 0.000
% 0.21/0.93 % Propositional solver time : 0.000
% 0.21/0.93 % Success case prop preproc time : 0.000
% 0.21/0.93 % Success case prop encoding time : 0.000
% 0.21/0.93 % Success case prop solver time : 0.000
% 0.21/0.93 % Current number of processed clauses : 232
% 0.21/0.93 % Positive orientable unit clauses : 59
% 0.21/0.93 % Positive unorientable unit clauses: 1
% 0.21/0.93 % Negative unit clauses : 42
% 0.21/0.93 % Non-unit-clauses : 130
% 0.21/0.93 % Current number of unprocessed clauses: 345
% 0.21/0.93 % ...number of literals in the above : 1128
% 0.21/0.93 % Current number of archived formulas : 0
% 0.21/0.93 % Current number of archived clauses : 473
% 0.21/0.93 % Clause-clause subsumption calls (NU) : 59283
% 0.21/0.93 % Rec. Clause-clause subsumption calls : 30228
% 0.21/0.93 % Non-unit clause-clause subsumptions : 262
% 0.21/0.93 % Unit Clause-clause subsumption calls : 1160
% 0.21/0.93 % Rewrite failures with RHS unbound : 0
% 0.21/0.93 % BW rewrite match attempts : 12
% 0.21/0.93 % BW rewrite match successes : 3
% 0.21/0.93 % Condensation attempts : 0
% 0.21/0.93 % Condensation successes : 0
% 0.21/0.93 % Termbank termtop insertions : 38049
% 0.21/0.93 % Search garbage collected termcells : 7740
% 0.21/0.93
% 0.21/0.93 % -------------------------------------------------
% 0.21/0.93 % User time : 0.141 s
% 0.21/0.93 % System time : 0.014 s
% 0.21/0.93 % Total time : 0.155 s
% 0.21/0.93 % Maximum resident set size: 5812 pages
% 0.21/0.93
% 0.21/0.93 % -------------------------------------------------
% 0.21/0.93 % User time : 0.277 s
% 0.21/0.93 % System time : 0.034 s
% 0.21/0.93 % Total time : 0.311 s
% 0.21/0.93 % Maximum resident set size: 5632 pages
% 0.21/0.93 % E exiting
%------------------------------------------------------------------------------