0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.11 % Command : run_portfolio.sh /export/starexec/sandbox2/benchmark/theBenchmark.p /export/starexec/sandbox2/tmp/tmp.maE8hoJwtT 0.11/0.31 % Computer : n009.cluster.edu 0.11/0.31 % Model : x86_64 x86_64 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.31 % Memory : 8042.1875MB 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.31 % CPULimit : 960 0.11/0.31 % DateTime : Thu Jul 2 06:42:51 EDT 2020 0.11/0.31 % CPUTime : 0.11/0.31 % Running portfolio for 120 s 0.11/0.31 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p 0.11/0.31 % Number of cores: 8 0.11/0.31 % Python version: Python 3.6.8 0.11/0.32 % Running in FO mode 0.68/0.90 % Running /export/starexec/sandbox2/solver/bin/fo/fo7.sh for 25 0.68/0.90 % Solved by: fo/fo7.sh 0.68/0.90 To remain in the chosen logic fragment, unification with booleans has been disabled. 0.68/0.90 % done 862 iterations in 0.489s 0.68/0.90 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p' 0.68/0.90 % SZS output start Refutation 0.68/0.90 tff(axiom_m10, axiom, 0.68/0.90 (axiom_m10 <=> 0.68/0.90 (![X]: is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))))). 0.68/0.90 tff('0', plain, 0.68/0.90 ( axiom_m10 0.68/0.90 | ~ is_a_theorem( 0.68/0.90 strict_implies(possibly(sk_X_30), necessarily(possibly(sk_X_30))))), 0.68/0.90 inference('cnf', [status(esa)], [axiom_m10])). 0.68/0.90 tff('1', plain, 0.68/0.90 (~ is_a_theorem( 0.68/0.90 strict_implies(possibly(sk_X_30), necessarily(possibly(sk_X_30))))) 0.68/0.90 <= (~ 0.68/0.90 ( is_a_theorem( 0.68/0.90 strict_implies(possibly(sk_X_30), 0.68/0.90 necessarily(possibly(sk_X_30)))))), 0.68/0.90 inference('split', [status(esa)], ['0'])). 0.68/0.90 tff('2', plain, ( axiom_m10) <= (( axiom_m10)), 0.68/0.90 inference('split', [status(esa)], ['0'])). 0.68/0.90 tff(s1_0_m10_axiom_m10, conjecture, (axiom_m10)). 0.68/0.90 tff(zf_stmt_0, negated_conjecture, (~axiom_m10)). 0.68/0.90 tff('3', plain, ~ axiom_m10, inference('cnf', [status(esa)], [zf_stmt_0])). 0.68/0.90 tff('4', plain, ~ ( axiom_m10), inference('sup-', [status(thm)], ['2', '3'])). 0.68/0.90 tff('5', plain, 0.68/0.90 ~ 0.68/0.90 ( is_a_theorem( 0.68/0.90 strict_implies(possibly(sk_X_30), necessarily(possibly(sk_X_30))))) | 0.68/0.90 ( axiom_m10), inference('split', [status(esa)], ['0'])). 0.68/0.90 tff('6', plain, 0.68/0.90 ~ 0.68/0.90 ( is_a_theorem( 0.68/0.90 strict_implies(possibly(sk_X_30), necessarily(possibly(sk_X_30))))), 0.68/0.90 inference('sat_resolution*', [status(thm)], ['4', '5'])). 0.68/0.90 tff('7', plain, 0.68/0.90 ~ is_a_theorem( 0.68/0.90 strict_implies(possibly(sk_X_30), necessarily(possibly(sk_X_30)))), 0.68/0.90 inference('simpl_trail', [status(thm)], ['1', '6'])). 0.68/0.90 tff(axiom_5, axiom, 0.68/0.90 ((![X]: is_a_theorem(implies(possibly(X),necessarily(possibly(X))))) <=> 0.68/0.90 axiom_5)). 0.68/0.90 tff('8', plain, 0.68/0.90 ![X101]: 0.68/0.90 ( is_a_theorem(implies(possibly(X101), necessarily(possibly(X101)))) 0.68/0.90 | ~ axiom_5), 0.68/0.90 inference('cnf', [status(esa)], [axiom_5])). 0.68/0.90 tff('9', plain, 0.68/0.90 (![X101]: 0.68/0.90 is_a_theorem(implies(possibly(X101), necessarily(possibly(X101))))) 0.68/0.90 <= ((![X101]: 0.68/0.90 is_a_theorem( 0.68/0.90 implies(possibly(X101), necessarily(possibly(X101)))))), 0.68/0.90 inference('split', [status(esa)], ['8'])). 0.68/0.90 tff(km5_axiom_5, axiom, (axiom_5)). 0.68/0.90 tff('10', plain, axiom_5, inference('cnf', [status(esa)], [km5_axiom_5])). 0.68/0.90 tff('11', plain, (~ axiom_5) <= (~ ( axiom_5)), 0.68/0.90 inference('split', [status(esa)], ['8'])). 0.68/0.90 tff('12', plain, ( axiom_5), inference('sup-', [status(thm)], ['10', '11'])). 0.68/0.90 tff('13', plain, 0.68/0.90 (![X101]: 0.68/0.90 is_a_theorem(implies(possibly(X101), necessarily(possibly(X101))))) | 0.68/0.90 ~ ( axiom_5), inference('split', [status(esa)], ['8'])). 0.68/0.90 tff('14', plain, 0.68/0.90 (![X101]: 0.68/0.90 is_a_theorem(implies(possibly(X101), necessarily(possibly(X101))))), 0.68/0.90 inference('sat_resolution*', [status(thm)], ['12', '13'])). 0.68/0.90 tff('15', plain, 0.68/0.90 ![X101]: 0.68/0.90 is_a_theorem(implies(possibly(X101), necessarily(possibly(X101)))), 0.68/0.90 inference('simpl_trail', [status(thm)], ['9', '14'])). 0.68/0.90 tff(op_strict_implies, axiom, 0.68/0.90 (op_strict_implies => 0.68/0.90 (![X,Y]: (necessarily(implies(X,Y)) = strict_implies(X,Y))))). 0.68/0.90 tff('16', plain, 0.68/0.90 ![X105, X106]: 0.68/0.90 (necessarily(implies(X105, X106)) = strict_implies(X105, X106) 0.68/0.90 | ~ op_strict_implies), 0.68/0.90 inference('cnf', [status(esa)], [op_strict_implies])). 0.68/0.90 tff('17', plain, 0.68/0.90 (![X105, X106]: 0.68/0.90 necessarily(implies(X105, X106)) = strict_implies(X105, X106)) 0.68/0.90 <= ((![X105, X106]: 0.68/0.90 necessarily(implies(X105, X106)) = strict_implies(X105, X106))), 0.68/0.90 inference('split', [status(esa)], ['16'])). 0.68/0.90 tff(s1_0_op_strict_implies, axiom, (op_strict_implies)). 0.68/0.90 tff('18', plain, op_strict_implies, 0.68/0.90 inference('cnf', [status(esa)], [s1_0_op_strict_implies])). 0.68/0.90 tff('19', plain, (~ op_strict_implies) <= (~ ( op_strict_implies)), 0.68/0.90 inference('split', [status(esa)], ['16'])). 0.68/0.90 tff('20', plain, ( op_strict_implies), 0.68/0.90 inference('sup-', [status(thm)], ['18', '19'])). 0.68/0.90 tff('21', plain, 0.68/0.90 (![X105, X106]: 0.68/0.90 necessarily(implies(X105, X106)) = strict_implies(X105, X106)) | 0.68/0.90 ~ ( op_strict_implies), inference('split', [status(esa)], ['16'])). 0.68/0.90 tff('22', plain, 0.68/0.90 (![X105, X106]: 0.68/0.90 necessarily(implies(X105, X106)) = strict_implies(X105, X106)), 0.68/0.90 inference('sat_resolution*', [status(thm)], ['20', '21'])). 0.68/0.90 tff('23', plain, 0.68/0.90 ![X105, X106]: 0.68/0.90 necessarily(implies(X105, X106)) = strict_implies(X105, X106), 0.68/0.90 inference('simpl_trail', [status(thm)], ['17', '22'])). 0.68/0.90 tff(necessitation, axiom, 0.68/0.90 (necessitation <=> 0.68/0.90 (![X]: (is_a_theorem(X) => is_a_theorem(necessarily(X)))))). 0.68/0.90 tff('24', plain, 0.68/0.90 ![X83]: 0.68/0.90 (~ is_a_theorem(X83) 0.68/0.90 | is_a_theorem(necessarily(X83)) 0.68/0.90 | ~ necessitation), 0.68/0.90 inference('cnf', [status(esa)], [necessitation])). 0.68/0.90 tff('25', plain, 0.68/0.90 (![X83]: (~ is_a_theorem(X83) | is_a_theorem(necessarily(X83)))) 0.68/0.90 <= ((![X83]: (~ is_a_theorem(X83) | is_a_theorem(necessarily(X83))))), 0.68/0.90 inference('split', [status(esa)], ['24'])). 0.68/0.90 tff(km5_necessitation, axiom, (necessitation)). 0.68/0.90 tff('26', plain, necessitation, 0.68/0.90 inference('cnf', [status(esa)], [km5_necessitation])). 0.68/0.90 tff('27', plain, (~ necessitation) <= (~ ( necessitation)), 0.68/0.90 inference('split', [status(esa)], ['24'])). 0.68/0.90 tff('28', plain, ( necessitation), 0.68/0.90 inference('sup-', [status(thm)], ['26', '27'])). 0.68/0.90 tff('29', plain, 0.68/0.90 (![X83]: (~ is_a_theorem(X83) | is_a_theorem(necessarily(X83)))) | 0.68/0.90 ~ ( necessitation), inference('split', [status(esa)], ['24'])). 0.68/0.90 tff('30', plain, 0.68/0.90 (![X83]: (~ is_a_theorem(X83) | is_a_theorem(necessarily(X83)))), 0.68/0.90 inference('sat_resolution*', [status(thm)], ['28', '29'])). 0.68/0.90 tff('31', plain, 0.68/0.90 ![X83]: (~ is_a_theorem(X83) | is_a_theorem(necessarily(X83))), 0.68/0.90 inference('simpl_trail', [status(thm)], ['25', '30'])). 0.68/0.90 tff('32', plain, 0.68/0.90 ![X0, X1]: 0.68/0.90 ( is_a_theorem(strict_implies(X1, X0)) 0.68/0.90 | ~ is_a_theorem(implies(X1, X0))), 0.68/0.90 inference('sup+', [status(thm)], ['23', '31'])). 0.68/0.90 tff('33', plain, 0.68/0.90 ![X0]: 0.68/0.90 is_a_theorem(strict_implies(possibly(X0), necessarily(possibly(X0)))), 0.68/0.90 inference('sup-', [status(thm)], ['15', '32'])). 0.68/0.90 tff('34', plain, $false, inference('demod', [status(thm)], ['7', '33'])). 0.68/0.90 0.68/0.90 % SZS output end Refutation 0.68/0.90 0.68/0.91 % Zipperpin 1.5 exiting 0.68/0.91 EOF