%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWW101+1 : TPTP v8.1.0. Released v5.2.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 : 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 : 600s % DateTime : Thu Jul 21 00:11:56 EDT 2022 % Result : Theorem 0.20s 0.41s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWW101+1 : TPTP v8.1.0. Released v5.2.0. % 0.03/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 : n021.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 : Sun Jun 5 02:59:04 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.20/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 80 Number of unprocessed: 62 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.39 # The folding up rule is enabled... % 0.20/0.39 # Local unification is enabled... % 0.20/0.39 # Any saturation attempts will use folding labels... % 0.20/0.39 # 62 beginning clauses after preprocessing and clausification % 0.20/0.39 # Creating start rules for all 1 conjectures. % 0.20/0.39 # There are 1 start rule candidates: % 0.20/0.39 # Found 21 unit axioms. % 0.20/0.39 # 1 start rule tableaux created. % 0.20/0.39 # 41 extension rule candidate clauses % 0.20/0.39 # 21 unit axiom clauses % 0.20/0.39 % 0.20/0.39 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.41 # There were 3 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 3 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 3 successful branch saturations after the branch. % 0.20/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_91, plain, (false1=false)). % 0.20/0.41 cnf(i_0_96, plain, (not1(false)=true)). % 0.20/0.41 cnf(i_0_97, plain, (not1(true)=false)). % 0.20/0.41 cnf(i_0_8, plain, (d(false))). % 0.20/0.41 cnf(i_0_9, plain, (d(true))). % 0.20/0.41 cnf(i_0_61, plain, (lazy_impl(false,X1)=true)). % 0.20/0.41 cnf(i_0_7, plain, (d(err))). % 0.20/0.41 cnf(i_0_71, plain, (lazy_and1(false,X1)=false)). % 0.20/0.41 cnf(i_0_72, plain, (lazy_and1(true,X1)=lazy_impl(true,X1))). % 0.20/0.41 cnf(i_0_94, plain, (lazy_impl(true,lazy_impl(prop(esk7_0),esk7_0))=false2)). % 0.20/0.41 cnf(i_0_6, plain, (true!=false)). % 0.20/0.41 cnf(i_0_4, plain, (err!=false)). % 0.20/0.41 cnf(i_0_5, plain, (err!=true)). % 0.20/0.41 cnf(i_0_83, plain, (~existsprefers(apply(X1,X2),apply(X1,esk4_1(X1))))). % 0.20/0.41 cnf(i_0_93, plain, (~forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk7_0),esk7_0)))). % 0.20/0.41 cnf(i_0_86, plain, (~forallprefers(impl(apply(X1,X2),X3),impl(apply(X1,esk5_2(X1,X3)),X3)))). % 0.20/0.42 cnf(i_0_68, plain, (~forallprefers(lazy_impl(prop(X1),impl(impl(X2,impl(X3,X1)),X1)),lazy_impl(prop(esk1_2(X2,X3)),impl(impl(X2,impl(X3,esk1_2(X2,X3))),esk1_2(X2,X3)))))). % 0.20/0.42 cnf(i_0_74, plain, (~forallprefers(lazy_impl(prop(X1),impl(lazy_impl(X2,impl(X3,X1)),X1)),lazy_impl(prop(esk2_2(X2,X3)),impl(lazy_impl(X2,impl(X3,esk2_2(X2,X3))),esk2_2(X2,X3)))))). % 0.20/0.42 cnf(i_0_81, plain, (~forallprefers(lazy_impl(prop(X1),impl(impl(X2,X1),impl(impl(X3,X1),X1))),lazy_impl(prop(esk3_2(X2,X3)),impl(impl(X2,esk3_2(X2,X3)),impl(impl(X3,esk3_2(X2,X3)),esk3_2(X2,X3))))))). % 0.20/0.42 cnf(i_0_89, plain, (~forallprefers(lazy_impl(prop(X1),impl(lazy_impl(true,impl(apply(X2,esk5_2(X2,X1)),X1)),X1)),lazy_impl(prop(esk6_1(X2)),impl(lazy_impl(true,impl(apply(X2,esk5_2(X2,esk6_1(X2))),esk6_1(X2))),esk6_1(X2)))))). % 0.20/0.42 cnf(i_0_99, negated_conjecture, (false2!=false)). % 0.20/0.42 cnf(i_0_2, plain, (bool(X1)|X1!=false)). % 0.20/0.42 cnf(i_0_1, plain, (bool(X1)|X1!=true)). % 0.20/0.42 cnf(i_0_54, plain, (prop(X1)=false|bool(X1))). % 0.20/0.42 cnf(i_0_52, plain, (prop(X1)=true|~bool(X1))). % 0.20/0.42 cnf(i_0_53, plain, (bool(X1)|prop(X1)!=true)). % 0.20/0.42 cnf(i_0_3, plain, (X1=true|X1=false|~bool(X1))). % 0.20/0.42 cnf(i_0_55, plain, (prop(X1)!=false|~bool(X1))). % 0.20/0.42 cnf(i_0_49, plain, (lazy_impl(true,X1)=X1|~d(X1))). % 0.20/0.42 cnf(i_0_10, plain, (forallprefers(X1,X2)|X2!=true|X1!=false)). % 0.20/0.42 cnf(i_0_50, plain, (lazy_impl(true,X1)=err|d(X1))). % 0.20/0.42 cnf(i_0_58, plain, (impl(false,X1)=true|~bool(X1))). % 0.20/0.42 cnf(i_0_65, plain, (and1(false,X1)=false|~bool(X1))). % 0.20/0.42 cnf(i_0_78, plain, (or1(true,X1)=true|~bool(X1))). % 0.20/0.42 cnf(i_0_29, plain, (existsprefers(X1,X2)|X2!=false|X1!=true)). % 0.20/0.42 cnf(i_0_59, plain, (impl(true,X1)=X1|~bool(X1))). % 0.20/0.42 cnf(i_0_66, plain, (and1(true,X1)=X1|~bool(X1))). % 0.20/0.42 cnf(i_0_79, plain, (or1(false,X1)=X1|~bool(X1))). % 0.20/0.42 cnf(i_0_95, plain, (lazy_impl(true,X1)=not1(X1)|bool(X1))). % 0.20/0.42 cnf(i_0_48, plain, (lazy_impl(true,X1)=err|lazy_impl(true,X1)=X1)). % 0.20/0.42 cnf(i_0_18, plain, (X1=false|d(X2)|~forallprefers(X1,X2))). % 0.20/0.42 cnf(i_0_12, plain, (forallprefers(X1,X2)|d(X1)|~d(X2))). % 0.20/0.42 cnf(i_0_31, plain, (existsprefers(X1,X2)|d(X1)|~d(X2))). % 0.20/0.42 cnf(i_0_36, plain, (X1=false|d(X1)|~existsprefers(X2,X1))). % 0.20/0.42 cnf(i_0_37, plain, (X1=true|d(X2)|~existsprefers(X1,X2))). % 0.20/0.42 cnf(i_0_17, plain, (X1=true|d(X1)|~forallprefers(X2,X1))). % 0.20/0.42 cnf(i_0_60, plain, (lazy_impl(X1,X2)=lazy_impl(true,X1)|bool(X1))). % 0.20/0.42 cnf(i_0_63, plain, (and1(X1,X2)=lazy_impl(true,X1)|bool(X1))). % 0.20/0.42 cnf(i_0_70, plain, (lazy_and1(X1,X2)=lazy_impl(true,X1)|bool(X1))). % 0.20/0.42 cnf(i_0_76, plain, (or1(X1,X2)=lazy_impl(true,X1)|bool(X1))). % 0.20/0.42 cnf(i_0_56, plain, (impl(X1,X2)=lazy_impl(true,X1)|bool(X1))). % 0.20/0.42 cnf(i_0_40, plain, (bool(X1)|~existsprefers(X2,X1)|~d(X2))). % 0.20/0.42 cnf(i_0_21, plain, (bool(X1)|~forallprefers(X2,X1)|~d(X2))). % 0.20/0.42 cnf(i_0_42, plain, (X1=false|~existsprefers(X2,X1)|~d(X2)|~bool(X2))). % 0.20/0.42 cnf(i_0_64, plain, (and1(X1,X2)=lazy_impl(true,X2)|bool(X2)|~bool(X1))). % 0.20/0.42 cnf(i_0_77, plain, (or1(X1,X2)=lazy_impl(true,X2)|bool(X2)|~bool(X1))). % 0.20/0.42 cnf(i_0_24, plain, (X1=false|~forallprefers(X1,X2)|~d(X1)|~bool(X1))). % 0.20/0.42 cnf(i_0_23, plain, (X1=true|~forallprefers(X2,X1)|~d(X2)|~bool(X2))). % 0.20/0.42 cnf(i_0_57, plain, (impl(X1,X2)=lazy_impl(true,X2)|bool(X2)|~bool(X1))). % 0.20/0.42 cnf(i_0_43, plain, (X1=true|~existsprefers(X1,X2)|~d(X1)|~bool(X1))). % 0.20/0.42 cnf(i_0_11, plain, (forallprefers(X1,X2)|bool(X1)|~d(X2)|~bool(X2))). % 0.20/0.42 cnf(i_0_30, plain, (existsprefers(X1,X2)|bool(X1)|~d(X2)|~bool(X2))). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 6 steps % 0.20/0.42 cnf(i_0_99, negated_conjecture, (false2!=false), inference(start_rule)). % 0.20/0.42 cnf(i_0_100, plain, (false2!=false), inference(extension_rule, [i_0_24])). % 0.20/0.42 cnf(i_0_188, plain, (~d(false2)), inference(extension_rule, [i_0_50])). % 0.20/0.42 cnf(i_0_187, plain, (~forallprefers(false2,X4)), inference(etableau_closure_rule, [i_0_187, ...])). % 0.20/0.42 cnf(i_0_189, plain, (~bool(false2)), inference(etableau_closure_rule, [i_0_189, ...])). % 0.20/0.42 cnf(i_0_337, plain, (lazy_impl(true,false2)=err), inference(etableau_closure_rule, [i_0_337, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.20/0.42 # We now have 5 tableaux to operate on % 0.20/0.42 # Found closed tableau during pool population. % 0.20/0.42 # Proof search is over... % 0.20/0.42 # Freeing feature tree %------------------------------------------------------------------------------