%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : SWX240_1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n021.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 : Wed Apr 29 02:38:10 PM UTC 2026 % Result : Timeout 299.58s 300.02s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX240_1 : TPTP v9.3.0. Released v9.3.0. % 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s % 0.17/0.34 % Computer : n021.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Wed Apr 29 03:08:20 EDT 2026 % 0.17/0.34 % CPUTime : % 0.86/1.17 ============================== Prover9 =============================== % 0.86/1.17 Prover9 (32) version 2009-11A, November 2009. % 0.86/1.17 Process 1137 was started by sandbox on n021.cluster.edu, % 0.86/1.17 Wed Apr 29 03:08:21 2026 % 0.86/1.17 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_931_n021.cluster.edu". % 0.86/1.17 ============================== end of head =========================== % 0.86/1.17 % 0.86/1.17 ============================== INPUT ================================= % 0.86/1.17 % 0.86/1.17 % Reading from file /tmp/Prover9_931_n021.cluster.edu % 0.86/1.17 % 0.86/1.17 set(prolog_style_variables). % 0.86/1.17 set(auto2). % 0.86/1.17 % set(auto2) -> set(auto). % 0.86/1.17 % set(auto) -> set(auto_inference). % 0.86/1.17 % set(auto) -> set(auto_setup). % 0.86/1.17 % set(auto_setup) -> set(predicate_elim). % 0.86/1.17 % set(auto_setup) -> assign(eq_defs, unfold). % 0.86/1.17 % set(auto) -> set(auto_limits). % 0.86/1.17 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.86/1.17 % set(auto_limits) -> assign(sos_limit, 20000). % 0.86/1.17 % set(auto) -> set(auto_denials). % 0.86/1.17 % set(auto) -> set(auto_process). % 0.86/1.17 % set(auto2) -> assign(new_constants, 1). % 0.86/1.17 % set(auto2) -> assign(fold_denial_max, 3). % 0.86/1.17 % set(auto2) -> assign(max_weight, "200.000"). % 0.86/1.17 % set(auto2) -> assign(max_hours, 1). % 0.86/1.17 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.86/1.17 % set(auto2) -> assign(max_seconds, 0). % 0.86/1.17 % set(auto2) -> assign(max_minutes, 5). % 0.86/1.17 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.86/1.17 % set(auto2) -> set(sort_initial_sos). % 0.86/1.17 % set(auto2) -> assign(sos_limit, -1). % 0.86/1.17 % set(auto2) -> assign(lrs_ticks, 3000). % 0.86/1.17 % set(auto2) -> assign(max_megs, 400). % 0.86/1.17 % set(auto2) -> assign(stats, some). % 0.86/1.17 % set(auto2) -> clear(echo_input). % 0.86/1.17 % set(auto2) -> set(quiet). % 0.86/1.17 % set(auto2) -> clear(print_initial_clauses). % 0.86/1.17 % set(auto2) -> clear(print_given). % 0.86/1.17 assign(lrs_ticks,-1). % 0.86/1.17 assign(sos_limit,10000). % 0.86/1.17 assign(order,kbo). % 0.86/1.17 set(lex_order_vars). % 0.86/1.17 clear(print_given). % 0.86/1.17 % 0.86/1.17 % formulas(sos). % not echoed (57 formulas) % 0.86/1.17 % 0.86/1.17 ============================== end of input ========================== % 0.86/1.17 % 0.86/1.17 % From the command line: assign(max_seconds, 300). % 0.86/1.17 % 0.86/1.17 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.86/1.17 % 0.86/1.17 % Formulas that are not ordinary clauses: % 0.86/1.17 1 (all X all X2 head(cons(X,X2)) = X) # label(axiom_001) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 2 (all X all X2 tail(cons(X,X2)) = X2) # label(axiom_002) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 3 (all X all X2 nil != cons(X,X2)) # label(axiom_003) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 4 (all X proj1Suc(suc(X)) = X) # label(axiom_004) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 5 (all X zero != suc(X)) # label(axiom_005) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 6 (all X proj1High(high(X)) = X) # label(axiom_006) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 7 (all X proj1Low(low(X)) = X) # label(axiom_007) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 8 (all X all X2 high(X) != low(X2)) # label(axiom_008) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 9 (all X all X2 proj1Nand(nand(X,X2)) = X) # label(axiom_009) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 10 (all X all X2 proj2Nand(nand(X,X2)) = X2) # label(axiom_010) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 11 (all X proj1Var(var(X)) = X) # label(axiom_011) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 12 (all X all X2 nand(X,X2) != tT) # label(axiom_012) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 13 (all X all X2 nand(X,X2) != fF) # label(axiom_013) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 14 (all X all X2 all X3 nand(X,X2) != var(X3)) # label(axiom_014) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 15 (all X tT != var(X)) # label(axiom_016) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 16 (all X fF != var(X)) # label(axiom_017) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 17 (all X all X2 proj1Assign(assign(X,X2)) = X) # label(axiom_018) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 18 (all X all X2 proj2Assign(assign(X,X2)) = X2) # label(axiom_019) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 19 (all X all X2 proj1Seq(seq(X,X2)) = X) # label(axiom_020) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 20 (all X all X2 proj2Seq(seq(X,X2)) = X2) # label(axiom_021) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 21 (all X all X2 all X3 proj1IfThenElse(ifThenElse(X,X2,X3)) = X) # label(axiom_022) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 22 (all X all X2 all X3 proj2IfThenElse(ifThenElse(X,X2,X3)) = X2) # label(axiom_023) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 23 (all X all X2 all X3 proj3IfThenElse(ifThenElse(X,X2,X3)) = X3) # label(axiom_024) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 24 (all X all X2 skip != assign(X,X2)) # label(axiom_025) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 25 (all X all X2 skip != seq(X,X2)) # label(axiom_026) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 26 (all X all X2 all X3 skip != ifThenElse(X,X2,X3)) # label(axiom_027) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 27 (all X all X2 all X3 all X4 assign(X,X2) != seq(X3,X4)) # label(axiom_028) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 28 (all X all X2 all X3 all X4 all X5 assign(X,X2) != ifThenElse(X3,X4,X5)) # label(axiom_029) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 29 (all X all X2 all X3 all X4 all X5 seq(X,X2) != ifThenElse(X3,X4,X5)) # label(axiom_030) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 30 (all X (X != nand(proj1Nand(X),proj2Nand(X)) -> (X != var(proj1Var(X)) -> -secret(X)))) # label(axiom_031) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 31 (all A all B (secret(nand(A,B)) <-> secret(A) | secret(B))) # label(axiom_032) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 32 (all Z secret(var(high(Z)))) # label(axiom_033) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 33 (all X2 -secret(var(low(X2)))) # label(axiom_034) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 34 (all E all Z typeCorrect(assign(high(Z),E))) # label(axiom_036) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 35 (all E all X2 (typeCorrect(assign(low(X2),E)) <-> -secret(E))) # label(axiom_037) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 36 (all P all Q (typeCorrect(seq(P,Q)) <-> typeCorrect(P) & typeCorrect(Q))) # label(axiom_038) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 37 (all C all R all Q2 (typeCorrect(ifThenElse(C,R,Q2)) <-> typeCorrect(R) & typeCorrect(Q2))) # label(axiom_039) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 38 (all X -elem(X,nil)) # label(axiom_042) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 39 (all X all Z all Xs (elem(X,cons(Z,Xs)) <-> Z = X | elem(X,Xs))) # label(axiom_043) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 40 (all X all A all B (eval(X,nand(A,B)) <-> -eval(X,A) | -eval(X,B))) # label(axiom_044) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 41 (all X eval(X,tT)) # label(axiom_045) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 42 (all X -eval(X,fF)) # label(axiom_046) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 43 (all X all Z (eval(X,var(Z)) <-> elem(Z,X))) # label(axiom_047) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 44 (all X del(X,nil) = nil) # label(axiom_048) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 45 (all X all Z all Ys (X = Z -> del(X,cons(Z,Ys)) = del(X,Ys))) # label(axiom_049) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 46 (all X all Z all Ys (X != Z -> del(X,cons(Z,Ys)) = cons(Z,del(X,Ys)))) # label(axiom_050) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 47 (all X run(X,skip) = X) # label(axiom_051) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 48 (all X all Z all E (eval(X,E) -> run(X,assign(Z,E)) = cons(Z,X))) # label(axiom_052) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 49 (all X all Z all E (-eval(X,E) -> run(X,assign(Z,E)) = del(Z,X))) # label(axiom_053) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 50 (all X all P all Q run(X,seq(P,Q)) = run(run(X,P),Q)) # label(axiom_054) # label(axiom) # label(non_clause). [assumption]. % 0.86/1.17 51 (all X all E2 all R all Q2 (eval(X,E2) -> run(X,ifThenElse(E2,R,Q2)) = run(X,R))) # label(axiom_055) # label(axiom) # label(non_clause). Terminated % 299.58/300.02 Prover9 interrupted %------------------------------------------------------------------------------