%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ141^1 : TPTP v9.3.1. Released v6.2.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 : Wed Sep 30 08:20:37 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 23 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 157 ( 23 ~; 17 |; 2 &; 109 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 0 ^; 24 !; 2 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
direction: $tType ).
thf(decl_sort2,type,
position: $tType ).
thf(decl_sort3,type,
movelist: $tType ).
thf(decl_24,type,
right: direction ).
thf(decl_27,type,
next: position > direction > position ).
thf(decl_28,type,
wall: position > $o ).
thf(decl_29,type,
nomove: movelist ).
thf(decl_30,type,
movedir: movelist > direction > movelist ).
thf(decl_31,type,
playerpos: movelist > position ).
thf(decl_32,type,
c00: position ).
thf(decl_33,type,
c10: position ).
thf(decl_34,type,
c20: position ).
thf(player_move_legal,axiom,
! [X4: position,X5: movelist,X6: direction] :
( ( ( playerpos @ X5 )
= X4 )
=> ( ~ ( wall @ ( next @ X4 @ X6 ) )
=> ( ( playerpos @ ( movedir @ X5 @ X6 ) )
= ( next @ X4 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zn0H3qrca8/E---3.1_1651070.p',player_move_legal) ).
thf(exercise,conjecture,
? [X5: movelist] :
( ( playerpos @ X5 )
= c20 ),
file('/export/starexec/sandbox2/tmp/tmp.zn0H3qrca8/E---3.1_1651070.p',exercise) ).
thf(c10_axiom,axiom,
( ( wall @ c10 )
<=> ~ $true ),
file('/export/starexec/sandbox2/tmp/tmp.zn0H3qrca8/E---3.1_1651070.p',c10_axiom) ).
thf(start_axiom,axiom,
( ( playerpos @ nomove )
= c00 ),
file('/export/starexec/sandbox2/tmp/tmp.zn0H3qrca8/E---3.1_1651070.p',start_axiom) ).
thf(c20_axiom,axiom,
( ( wall @ c20 )
<=> ~ $true ),
file('/export/starexec/sandbox2/tmp/tmp.zn0H3qrca8/E---3.1_1651070.p',c20_axiom) ).
thf(c10_defin,axiom,
( c10
= ( next @ c00 @ right ) ),
file('/export/starexec/sandbox2/tmp/tmp.zn0H3qrca8/E---3.1_1651070.p',c10_defin) ).
thf(c20_defin,axiom,
( c20
= ( next @ c10 @ right ) ),
file('/export/starexec/sandbox2/tmp/tmp.zn0H3qrca8/E---3.1_1651070.p',c20_defin) ).
thf(c_0_7,plain,
! [X4: position,X5: movelist,X6: direction] :
( ( ( playerpos @ X5 )
= X4 )
=> ( ~ ( wall @ ( next @ X4 @ X6 ) )
=> ( ( playerpos @ ( movedir @ X5 @ X6 ) )
= ( next @ X4 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[player_move_legal]) ).
thf(c_0_8,negated_conjecture,
~ ? [X5: movelist] :
( ( playerpos @ X5 )
= c20 ),
inference(assume_negation,[status(cth)],[exercise]) ).
thf(c_0_9,plain,
! [X24: position,X25: movelist,X26: direction] :
( ( ( playerpos @ X25 )
!= X24 )
| ( wall @ ( next @ X24 @ X26 ) )
| ( ( playerpos @ ( movedir @ X25 @ X26 ) )
= ( next @ X24 @ X26 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
thf(c_0_10,negated_conjecture,
! [X30: movelist] :
( ( playerpos @ X30 )
!= c20 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
thf(c_0_11,plain,
! [X5: movelist,X1: direction,X3: position] :
( ( wall @ ( next @ X3 @ X1 ) )
| ( ( playerpos @ ( movedir @ X5 @ X1 ) )
= ( next @ X3 @ X1 ) )
| ( ( playerpos @ X5 )
!= X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X5: movelist] :
( ( playerpos @ X5 )
!= c20 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
! [X5: movelist,X1: direction] :
( ( ( playerpos @ ( movedir @ X5 @ X1 ) )
= ( next @ ( playerpos @ X5 ) @ X1 ) )
| ( wall @ ( next @ ( playerpos @ X5 ) @ X1 ) ) ),
inference(er,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X5: movelist,X1: direction] :
( ( wall @ ( next @ ( playerpos @ X5 ) @ X1 ) )
| ( ( next @ ( playerpos @ X5 ) @ X1 )
!= c20 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_15,plain,
( ( ~ ( wall @ c10 )
| ~ $true )
& ( $true
| ( wall @ c10 ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c10_axiom])]) ).
thf(c_0_16,negated_conjecture,
! [X5: movelist,X1: direction,X2: direction] :
( ( wall @ ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 ) )
| ( wall @ ( next @ ( playerpos @ X5 ) @ X1 ) )
| ( ( next @ ( next @ ( playerpos @ X5 ) @ X1 ) @ X2 )
!= c20 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
thf(c_0_17,plain,
( ( playerpos @ nomove )
= c00 ),
inference(split_conjunct,[status(thm)],[start_axiom]) ).
thf(c_0_18,plain,
( ~ ( wall @ c10 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,plain,
( ( ~ ( wall @ c20 )
| ~ $true )
& ( $true
| ( wall @ c20 ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c20_axiom])]) ).
thf(c_0_20,negated_conjecture,
! [X1: direction,X2: direction] :
( ( wall @ ( next @ ( next @ c00 @ X1 ) @ X2 ) )
| ( wall @ ( next @ c00 @ X1 ) )
| ( ( next @ ( next @ c00 @ X1 ) @ X2 )
!= c20 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_21,plain,
( c10
= ( next @ c00 @ right ) ),
inference(split_conjunct,[status(thm)],[c10_defin]) ).
thf(c_0_22,plain,
~ ( wall @ c10 ),
inference(cn,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
( ~ ( wall @ c20 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_24,negated_conjecture,
! [X1: direction] :
( ( wall @ ( next @ c10 @ X1 ) )
| ( ( next @ c10 @ X1 )
!= c20 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
thf(c_0_25,plain,
( c20
= ( next @ c10 @ right ) ),
inference(split_conjunct,[status(thm)],[c20_defin]) ).
thf(c_0_26,plain,
~ ( wall @ c20 ),
inference(cn,[status(thm)],[c_0_23]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ141^1 : TPTP v9.3.1. Released v6.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n005.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:26:46 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.25 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.zn0H3qrca8/E---3.1_1651070.p
% 0.22/0.29 % Version: 3.5.1-ho
% 0.22/0.29 % partial match(1): FSMSSMSMSSSNFFN
% 0.22/0.29 % Preprocessing class: HSMSSMSMSSSNFFN.
% 0.22/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.29 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.29 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.29 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.29 % Starting sh5l with 300s (1) cores
% 0.22/0.29 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1651093 completed with status 0
% 0.22/0.29 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.22/0.29 % partial match(1): FSMSSMSMSSSNFFN
% 0.22/0.29 % Preprocessing class: HSMSSMSMSSSNFFN.
% 0.22/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.29 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.29 % No SInE strategy applied
% 0.22/0.29 % Search class: HGUSS-FFSS21-SFFFFFNN
% 0.22/0.29 % partial match(1): FGUSS-FFSS21-SFFFFFNN
% 0.22/0.29 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.29 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.29 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.22/0.29 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.22/0.29 % Starting new_bool_3 with 136s (1) cores
% 0.22/0.29 % Starting new_bool_1 with 136s (1) cores
% 0.22/0.29 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1651102 completed with status 0
% 0.22/0.29 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.22/0.29 % partial match(1): FSMSSMSMSSSNFFN
% 0.22/0.29 % Preprocessing class: HSMSSMSMSSSNFFN.
% 0.22/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.29 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.29 % No SInE strategy applied
% 0.22/0.29 % Search class: HGUSS-FFSS21-SFFFFFNN
% 0.22/0.29 % partial match(1): FGUSS-FFSS21-SFFFFFNN
% 0.22/0.29 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.29 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.29 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.22/0.29 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.22/0.29 % Preprocessing time : 0.001 s
% 0.22/0.29 % Presaturation interreduction done
% 0.22/0.29
% 0.22/0.29 % Proof found!
% 0.22/0.29 % SZS status Theorem
% 0.22/0.29 % SZS output start CNFRefutation
% See solution above
% 0.22/0.29 % Parsed axioms : 27
% 0.22/0.29 % Removed by relevancy pruning/SinE : 0
% 0.22/0.29 % Initial clauses : 30
% 0.22/0.29 % Removed in clause preprocessing : 18
% 0.22/0.29 % Initial clauses in saturation : 12
% 0.22/0.29 % Processed clauses : 48
% 0.22/0.29 % ...of these trivial : 2
% 0.22/0.29 % ...subsumed : 6
% 0.22/0.29 % ...remaining for further processing : 40
% 0.22/0.29 % Other redundant clauses eliminated : 2
% 0.22/0.29 % Clauses deleted for lack of memory : 0
% 0.22/0.29 % Backward-subsumed : 0
% 0.22/0.29 % Backward-rewritten : 1
% 0.22/0.29 % Generated clauses : 74
% 0.22/0.29 % ...of the previous two non-redundant : 54
% 0.22/0.29 % ...aggressively subsumed : 0
% 0.22/0.29 % Contextual simplify-reflections : 0
% 0.22/0.29 % Paramodulations : 72
% 0.22/0.29 % Factorizations : 0
% 0.22/0.29 % NegExts : 0
% 0.22/0.29 % Equation resolutions : 2
% 0.22/0.29 % Disequality decompositions : 0
% 0.22/0.29 % Total rewrite steps : 27
% 0.22/0.29 % ...of those cached : 14
% 0.22/0.29 % Propositional unsat checks : 0
% 0.22/0.29 % Propositional check models : 0
% 0.22/0.29 % Propositional check unsatisfiable : 0
% 0.22/0.29 % Propositional clauses : 0
% 0.22/0.29 % Propositional clauses after purity: 0
% 0.22/0.29 % Propositional unsat core size : 0
% 0.22/0.29 % Propositional preprocessing time : 0.000
% 0.22/0.29 % Propositional encoding time : 0.000
% 0.22/0.29 % Propositional solver time : 0.000
% 0.22/0.29 % Success case prop preproc time : 0.000
% 0.22/0.29 % Success case prop encoding time : 0.000
% 0.22/0.29 % Success case prop solver time : 0.000
% 0.22/0.29 % Current number of processed clauses : 25
% 0.22/0.29 % Positive orientable unit clauses : 11
% 0.22/0.29 % Positive unorientable unit clauses: 1
% 0.22/0.29 % Negative unit clauses : 6
% 0.22/0.29 % Non-unit-clauses : 7
% 0.22/0.29 % Current number of unprocessed clauses: 30
% 0.22/0.29 % ...number of literals in the above : 44
% 0.22/0.29 % Current number of archived formulas : 0
% 0.22/0.29 % Current number of archived clauses : 13
% 0.22/0.29 % Clause-clause subsumption calls (NU) : 9
% 0.22/0.29 % Rec. Clause-clause subsumption calls : 9
% 0.22/0.29 % Non-unit clause-clause subsumptions : 1
% 0.22/0.29 % Unit Clause-clause subsumption calls : 13
% 0.22/0.29 % Rewrite failures with RHS unbound : 0
% 0.22/0.29 % BW rewrite match attempts : 8
% 0.22/0.29 % BW rewrite match successes : 8
% 0.22/0.29 % Condensation attempts : 0
% 0.22/0.29 % Condensation successes : 0
% 0.22/0.29 % Termbank termtop insertions : 1802
% 0.22/0.29 % Search garbage collected termcells : 121
% 0.22/0.29
% 0.22/0.29 % -------------------------------------------------
% 0.22/0.29 % User time : 0.008 s
% 0.22/0.29 % System time : 0.003 s
% 0.22/0.29 % Total time : 0.011 s
% 0.22/0.29 % Maximum resident set size: 3648 pages
% 0.22/0.29
% 0.22/0.29 % -------------------------------------------------
% 0.22/0.29 % User time : 0.046 s
% 0.22/0.29 % System time : 0.013 s
% 0.22/0.29 % Total time : 0.059 s
% 0.22/0.29 % Maximum resident set size: 4864 pages
% 0.22/0.29 % E exiting
%------------------------------------------------------------------------------