%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN303-10 : TPTP v8.1.0. Released v7.5.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n018.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 : 600s % DateTime : Thu Jul 21 06:09:41 EDT 2022 % Result : Satisfiable 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.13 % Problem : SYN303-10 : TPTP v8.1.0. Released v7.5.0. % 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n018.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jul 12 09:01:44 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Number of axioms: 6 Number of unprocessed: 6 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 6 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 5 conjectures. % 0.13/0.38 # There are 5 start rule candidates: % 0.13/0.38 # Found 6 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 5 start rule tableaux created. % 0.13/0.38 # 0 extension rule candidate clauses % 0.13/0.38 # 6 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 5 % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 15 tableaux to operate on % 0.13/0.38 # 10365 Satisfiable branch % 0.13/0.38 # 10366 Satisfiable branch % 0.13/0.38 # 10364 Satisfiable branch % 0.13/0.38 # 10367 Satisfiable branch % 0.13/0.38 # 10368 Satisfiable branch % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # 10369 Satisfiable branch % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X1,X1)=true)). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p(a,f(X1))!=true)). % 0.13/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (ifeq(p(X1,X2),true,p(X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (ifeq(p(X1,X2),true,p(f(X1),f(X2)),true)=true)). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (ifeq(p(f(X1),f(X2)),true,p(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_18, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X7,X7)=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (p(X7,X7)=true), inference(extension_rule, [i_0_23])). % 0.13/0.38 cnf(i_0_45, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_44, plain, (p(p(true,true),p(X7,X7))=p(true,true)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_55, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X1,X1)=true)). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p(a,f(X1))!=true)). % 0.13/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (ifeq(p(X1,X2),true,p(X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (ifeq(p(X1,X2),true,p(f(X1),f(X2)),true)=true)). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (ifeq(p(f(X1),f(X2)),true,p(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_18, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X6,X6)=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (p(X6,X6)=true), inference(extension_rule, [i_0_23])). % 0.13/0.38 cnf(i_0_46, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_44, plain, (p(p(X6,X6),p(true,true))=p(true,true)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_55, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # 10370 Satisfiable branch % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X1,X1)=true)). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p(a,f(X1))!=true)). % 0.13/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (ifeq(p(X1,X2),true,p(X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (ifeq(p(X1,X2),true,p(f(X1),f(X2)),true)=true)). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (ifeq(p(f(X1),f(X2)),true,p(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_18, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 6 steps % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X13,X13)=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (p(X13,X13)=true), inference(extension_rule, [i_0_24])). % 0.13/0.38 cnf(i_0_47, plain, (f(p(X13,X13))=f(true)), inference(extension_rule, [i_0_22])). % 0.13/0.38 cnf(i_0_119, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_120, plain, (p(X1,X1)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_121, plain, (f(p(X13,X13))!=f(true)), inference(closure_rule, [i_0_47])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X1,X1)=true)). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p(a,f(X1))!=true)). % 0.13/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (ifeq(p(X1,X2),true,p(X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (ifeq(p(X1,X2),true,p(f(X1),f(X2)),true)=true)). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (ifeq(p(f(X1),f(X2)),true,p(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_18, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X16,X16)=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (p(X16,X16)=true), inference(extension_rule, [i_0_22])). % 0.13/0.38 cnf(i_0_40, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_41, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_43, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_39, plain, (ifeq(p(true,true),p(true,true),p(X16,X16),p(true,true))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_55, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_7])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X1,X1)=true)). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p(a,f(X1))!=true)). % 0.13/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (ifeq(p(X1,X2),true,p(X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (ifeq(p(X1,X2),true,p(f(X1),f(X2)),true)=true)). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (ifeq(p(f(X1),f(X2)),true,p(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_18, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X17,X17)=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (p(X17,X17)=true), inference(extension_rule, [i_0_22])). % 0.13/0.38 cnf(i_0_40, plain, (p(X17,X17)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_41, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_42, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_39, plain, (ifeq(p(X17,X17),p(true,true),p(true,true),p(X17,X17))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_55, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_7])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X1,X1)=true)). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p(a,f(X1))!=true)). % 0.13/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (ifeq(p(X1,X2),true,p(X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (ifeq(p(X1,X2),true,p(f(X1),f(X2)),true)=true)). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (ifeq(p(f(X1),f(X2)),true,p(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_18, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X15,X15)=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (p(X15,X15)=true), inference(extension_rule, [i_0_22])). % 0.13/0.38 cnf(i_0_40, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_42, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_43, plain, (p(true,true)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_39, plain, (ifeq(p(true,true),p(X15,X15),p(true,true),p(true,true))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_55, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_7])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # 10371 Satisfiable branch % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X1,X1)=true)). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p(a,f(X1))!=true)). % 0.13/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (ifeq(p(X1,X2),true,p(X2,X1),true)=true)). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (ifeq(p(X1,X2),true,p(f(X1),f(X2)),true)=true)). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (ifeq(p(f(X1),f(X2)),true,p(X1,X2),true)=true)). % 0.13/0.38 cnf(i_0_18, plain, (X4=X4)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_8, negated_conjecture, (p(X14,X14)=true), inference(start_rule)). % 0.13/0.38 cnf(i_0_25, plain, (p(X14,X14)=true), inference(extension_rule, [i_0_22])). % 0.13/0.38 cnf(i_0_41, plain, (p(X14,X14)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_42, plain, (p(X14,X14)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_43, plain, (p(X14,X14)!=true), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_39, plain, (ifeq(p(X14,X14),p(X14,X14),p(X14,X14),p(X14,X14))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_55, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_7])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (10366) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------