%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1 % Problem : NLP024+1 : TPTP v9.2.1. Released v2.4.0. % Transfm : none % Format : tptp % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n001.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 : Thu May 7 07:29:03 PM UTC 2026 % Result : CounterSatisfiable 1.42s 0.83s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : NLP024+1 : TPTP v9.2.1. Released v2.4.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.35 % Computer : n001.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Thu May 7 12:44:04 EDT 2026 % 0.18/0.35 % CPUTime : % 0.18/0.35 SPASS-SCL-FOL version: % 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode] % 1.42/0.83 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 1.42/0.83 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 1.42/0.83 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 1.42/0.83 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 1.42/0.83 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 1.42/0.83 Execution lmodel_grow ended with status: satisfiable % 1.42/0.83 Used heuristic: lmodel_grow % 1.42/0.83 % 1.42/0.83 Input Clauses: % 1.42/0.83 % 1.42/0.83 Predicates: man male human_person vincent_forename forename woman female animate human organism living impartial entity existent specific thing mia_forename relname relation abstraction unisex general nonhuman proposition desire_want event eventuality nonexistent singleton dance accessible_world of theme agent present = actual_world % 1.42/0.83 Fol Constants: skc1 skc2 skc3 skc4 skc5 skc6 skc7 skc8 % 1.42/0.83 Fol Functions: % 1.42/0.83 Problem Properties: % 1.42/0.83 This is a Bernays Schoenfinkel Ramsey problem. % 1.42/0.83 % 1.42/0.83 % 1.42/0.83 Reduced Input Clauses: % 1.42/0.83 94:9:3:[31.1,93.6]:TopTopTop: proposition(skc1,x0),present(skc1,x1),theme(skc1,x1,x0),desire_want(skc1,x1),agent(skc1,x1,skc2),accessible_world(skc1,x0),agent(x0,x2,skc2),present(x0,x2),dance(x0,x2) -> % 1.42/0.83 % 1.42/0.83 Most General Atoms: accessible_world(x0,x1) male(x1,x2) man(x1,x2) vincent_forename(x1,x2) female(x1,x2) animate(x1,x2) human(x1,x2) living(x1,x2) impartial(x1,x2) existent(x1,x2) entity(x1,x2) organism(x1,x2) human_person(x1,x2) woman(x1,x2) mia_forename(x1,x2) relname(x1,x2) general(x1,x2) nonhuman(x1,x2) abstraction(x1,x2) relation(x1,x2) agent(x1,x2,x3) present(x1,x2) unisex(x1,x2) nonexistent(x1,x2) specific(x1,x2) singleton(x1,x2) thing(x1,x2) eventuality(x1,x2) event(x1,x2) dance(x1,x2) forename(x0,x3) of(x0,x3,x1) desire_want(x0,x3) proposition(x0,x4) theme(x0,x3,x4) =(x2,x4) actual_world(skc1) % 1.42/0.83 % 1.42/0.83 === Starting SPASS-SCL-FOL A Little Less Naive, considering 62 atoms initially, heuristics mode: lmodel_grow === % 1.42/0.83 % 1.42/0.83 === CC is in false state. New clause to be learned: 95:1:0:TAUT:: -> =(skc1,skc1) % 1.42/0.83 === Restarting. % 1.42/0.83 === CC model inconsistency. New clause to be learned: 97:2:0:[76.0,96.1]:: =(skc1,skc2) -> man(skc1,skc1) % 1.42/0.83 === Restarting. % 1.42/0.83 === CC model inconsistency. New clause to be learned: 98:5:0:TAUT:: =(skc1,skc3),=(skc1,skc2),=(skc1,skc8),vincent_forename(skc8,skc3) -> vincent_forename(skc1,skc2) % 1.42/0.83 === Restarting. % 1.42/0.83 === CC is in false state. New clause to be learned: 100:2:0:[78.0,99.1]:: =(skc1,skc3) -> forename(skc1,skc1) % 1.42/0.83 === Restarting. % 1.42/0.83 === CC is in false state. New clause to be learned: 102:2:0:[77.0,101.1]:: =(skc1,skc8) -> vincent_forename(skc8,skc3) % 1.42/0.83 === Restarting. % 1.42/0.83 === CC model inconsistency. New clause to be learned: 104:2:0:[76.0,103.1]:: =(skc2,skc1) -> man(skc1,skc1) % 1.42/0.83 === Restarting. % 1.42/0.83 === CC model inconsistency. New clause to be learned: 105:1:0:TAUT:: -> =(skc2,skc2) % 1.42/0.83 === Restarting. % 1.42/0.83 === CC model inconsistency. New clause to be learned: 106:3:0:TAUT:: =(skc1,skc8),vincent_forename(skc8,skc2) -> vincent_forename(skc1,skc2) % 1.42/0.83 === Restarting. % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 84 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 100 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 124 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 155 % 1.42/0.83 === Backtracking. Learning clause 107:3:3:[25.1,69.3,37.1]:TopTopTop: accessible_world(x0,x1),eventuality(x0,x2),male(x1,x2) -> % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 191 % 1.42/0.83 === Backtracking. Learning clause 108:3:3:[33.2,42.3]:TopTopTop: male(x0,x1),accessible_world(x2,x0),female(x2,x1) -> % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 220 % 1.42/0.83 === Backtracking. Learning clause 109:3:3:[35.1,66.3]:TopTopTop: general(x0,x1),accessible_world(x2,x0),specific(x2,x1) -> % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 252 % 1.42/0.83 === Backtracking. Learning clause 110:2:2:[37.1,18.2]:TopTop: male(x0,x1),abstraction(x0,x1) -> % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 287 % 1.42/0.83 === Backtracking. Learning clause 111:3:3:[69.3,27.1]:TopTopTop: accessible_world(x0,x1),eventuality(x0,x2) -> specific(x1,x2) % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 312 % 1.42/0.83 === Backtracking. Learning clause 112:3:3:[37.1,25.2,38.3]:TopTopTop: eventuality(x0,x1),accessible_world(x2,x0),male(x2,x1) -> % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 336 % 1.42/0.83 === Backtracking. Learning clause 113:2:2:[18.1,22.2]:TopTop: relation(x0,x1) -> unisex(x0,x1) % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 355 % 1.42/0.83 === Backtracking. Learning clause 114:4:5:[60.2,60.3]:TopTopTopTopTop: accessible_world(x0,x1),accessible_world(x2,x0),theme(x2,x3,x4) -> theme(x1,x3,x4) % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 371 % 1.42/0.83 === Backtracking. Learning clause 115:2:2:[35.1,10.2]:TopTop: general(x0,x1),entity(x0,x1) -> % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 386 % 1.42/0.83 === Backtracking. Learning clause 116:4:4:[38.3,38.2]:TopTopTopTop: accessible_world(x0,x1),male(x0,x2),accessible_world(x1,x3) -> male(x3,x2) % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 400 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 410 % 1.42/0.83 === Backtracking. Learning clause 117:3:3:[19.2,109.1,22.2,16.2,17.2]:TopTopTop: accessible_world(x0,x1),specific(x0,x2),forename(x1,x2) -> % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 419 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 424 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 426 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 428 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 432 % 1.42/0.83 === Backtracking. Learning clause 118:2:2:[22.1,16.2,20.1]:TopTop: relname(x0,x1) -> nonhuman(x0,x1) % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 435 % 1.42/0.83 === Backtracking. Learning clause 119:2:2:[16.2,113.1]:TopTop: relname(x0,x1) -> unisex(x0,x1) % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 439 % 1.42/0.83 === Clause set with instances from active satisfied. Growing active. New size: 441 % 1.42/0.83 % 1.42/0.83 Linear Model Building succeeded. % 1.42/0.83 SZS status Satisfiable % 1.42/0.83 % 1.42/0.83 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 1.42/0.83 % 1.42/0.83 SPASS-SCL-FOL Statistics: % 1.42/0.83 Number of learned clauses: 13 % 1.42/0.83 Number of propagations: 2790 % 1.42/0.83 Number of decisions: 1217 % 1.42/0.83 Number of resolutions: 19 % 1.42/0.83 Number of condensations: 0 % 1.42/0.83 Number of sub resolutions: 5 % 1.42/0.83 Number of input literals (deduplicated): 62 % 1.42/0.83 Number of grows: 23 % 1.42/0.83 Number of considered ground atoms: 441 % 1.42/0.83 % 1.42/0.83 Needed: 0:00:00.25 % 1.42/0.83 %------------------------------------------------------------------------------